Journals in DBLP

Theor. Comput. Sci.
2007, volume: 384, number: 1

1. S. Barry Cooper, Angsheng Li
   Preface: Theory and applications of models of computation. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:1, pp:1- [Journal]
   
2. Jan Arpe, Rüdiger Reischuk
   Learning juntas in the presence of noise. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:1, pp:2-21 [Journal]
   
3. Jin-yi Cai, Vinay Choudhary
   Valiant's Holant Theorem and matchgate tensors. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:1, pp:22-32 [Journal]
   
4. Marcus Hutter
   On universal prediction and Bayesian confirmation. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:1, pp:33-48 [Journal]
   
5. Sanjay Jain, Jochen Nessel, Frank Stephan
   Invertible classes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:1, pp:49-65 [Journal]
   
6. Lisa Hellerstein, Rocco A. Servedio
   On PAC learning algorithms for rich Boolean function classes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:1, pp:66-76 [Journal]
   
7. Andrej Muchnik, Alexander Shen, Mikhail Ustinov, Nikolai K. Vereshchagin, Michael V. Vyugin
   Non-reducible descriptions for conditional Kolmogorov complexity. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:1, pp:77-86 [Journal]
   
8. Xiaoming Sun
   Block sensitivity of weakly symmetric functions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:1, pp:87-91 [Journal]
   
9. Xuehou Tan
   A linear-time 2-approximation algorithm for the watchman route problem for simple polygons. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:1, pp:92-103 [Journal]
   
10. Alasdair Urquhart
    Width versus size in resolution proofs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:1, pp:104-110 [Journal]
    
11. Mingji Xia, Peng Zhang, Wenbo Zhao
    Computational complexity of counting problems on 3-regular planar graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:1, pp:111-125 [Journal]
    
12. Peng Zhang
    A new approximation algorithm for the k-facility location problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:1, pp:126-135 [Journal]