Journals in DBLP

Theor. Comput. Sci.
2007, volume: 383, number: 2-3

1. Mark Burgin, Cristian S. Calude
   Preface. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:383, n:2-3, pp:111-114 [Journal]
   
2. Chris Pollett, Norman Danner
   Circuit principles and weak pigeonhole variants. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:383, n:2-3, pp:115-131 [Journal]
   
3. James M. Calvin
   A lower bound on complexity of optimization on the Wiener space. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:383, n:2-3, pp:132-139 [Journal]
   
4. Arto Salomaa, Kai Salomaa, Sheng Yu
   State complexity of combined operations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:383, n:2-3, pp:140-152 [Journal]
   
5. Lane A. Hemaspaandra, Mayur Thakur
   Query-monotonic Turing reductions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:383, n:2-3, pp:153-186 [Journal]
   
6. Ludwig Staiger
   The Kolmogorov complexity of infinite words. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:383, n:2-3, pp:187-199 [Journal]
   
7. Eugene Eberbach
   The $-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:383, n:2-3, pp:200-243 [Journal]
   
8. Mark Burgin
   Algorithmic complexity as a criterion of unsolvability. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:383, n:2-3, pp:244-259 [Journal]
   
9. Jirí Wiedermann
   Autopoietic automata: Complexity issues in offspring-producing evolving processes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:383, n:2-3, pp:260-269 [Journal]
   
10. Kevin T. Kelly
    Ockham's razor, empirical complexity, and truth-finding efficiency. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:383, n:2-3, pp:270-289 [Journal]