期刊


ISSN0304-3975
刊名Theoretical Computer Science
参考译名理论计算机科学
收藏年代2002～2024



全部

2002 2003 2004 2005 2006 2007
2008 2009 2010 2011 2012 2013
2014 2015 2016 2017 2018 2019
2020 2021 2022 2023 2024

2007, vol.370, no.1-3 2007, vol.371, no.1-2 2007, vol.371, no.3 2007, vol.372, no.1 2007, vol.372, no.2-3 2007, vol.373, no.1-2
2007, vol.373, no.3 2007, vol.374, no.1-3 2007, vol.375, no.1-3 2007, vol.376, no.1-2 2007, vol.376, no.3 2007, vol.377, no.1-3
2007, vol.378, no.1 2007, vol.378, no.2 2007, vol.378, no.3 2007, vol.379, no.1-2 2007, vol.379, no.3 2007, vol.380, no.1-2
2007, vol.380, no.3 2007, vol.381, no.1-3 2007, vol.382, no.1 2007, vol.382, no.2 2007, vol.382, no.3 2007, vol.383, no.1
2007, vol.383, no.2-3 2007, vol.384, no.1 2007, vol.384, no.2-3 2007, vol.385, no.1-3 2007, vol.386, no.1-2 2007, vol.386, no.3
2007, vol.387, no.1 2007, vol.387, no.2 2007, vol.387, no.3 2007, vol.388, no.1-3 2007, vol.389, no.1-2 2007, vol.389, no.3

题名作者出版年年卷期
State complexity of combined operationsArto Salomaa; Kai Salomaa; Sheng Yu20072007, vol.383, no.2-3
Query-monotonic Turing reductionsLane A. Hemaspaandra; Mayur Thakur20072007, vol.383, no.2-3
The Kolmogorov complexity of infinite wordsLudwig Staiger20072007, vol.383, no.2-3
Ockham's razor, empirical complexity, and truth-finding efficiencyKevin T. Kelly20072007, vol.383, no.2-3
Autopoietic automata: Complexity issues in offspring-producing evolving processesJiri Wiedermann20072007, vol.383, no.2-3
A lower bound on complexity of optimization on the Wiener spaceJames M. Calvin20072007, vol.383, no.2-3
Circuit principles and weak pigeonhole variantsChris Pollett; Norman Danner20072007, vol.383, no.2-3
The $-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problemsEugene Eberbach20072007, vol.383, no.2-3
Algorithmic complexity as a criterion of unsolvabilityMark Burgin20072007, vol.383, no.2-3



制造业外文文献服务平台