Journals in DBLP

J. Comput. Syst. Sci.
1996, volume: 53, number: 2

1. Manindra Agrawal, Somenath Biswas
   Polynomial-Time Isomorphism of 1-L-Complete Sets. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:2, pp:155-160 [Journal]
   
2. Christos H. Papadimitriou, Mihalis Yannakakis
   On Limited Nondeterminism and the Complexity of the V-C Dimension. [Citation Graph (2, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:2, pp:161-170 [Journal]
   
3. Mitsunori Ogihara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
   On Closure Properties of #P in the Context of PF ° #P. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:2, pp:171-179 [Journal]
   
4. Tirza Hirst, David Harel
   Taking It to the Limit: On Infinite Variants of NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:2, pp:180-193 [Journal]
   
5. Edith Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
   P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:2, pp:194-209 [Journal]
   
6. Harry Buhrman, Leen Torenvliet
   P-Selektive Self-Reducible Sets: A New Characterization of P. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:2, pp:210-217 [Journal]
   
7. Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
   Pointers versus Arithmetic in PRAMs. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:2, pp:218-232 [Journal]
   
8. Steven M. Kautz, Peter Bro Miltersen
   Relative to a Random Oracle, NP Is Not Small. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:2, pp:235-250 [Journal]
   
9. Gábor Tardos
   Multi-prover Encoding Schemes and Three-prover Proof Systems. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:2, pp:251-260 [Journal]
   
10. Harry Buhrman, Pekka Orponen
    Random Strings Make Hard Instances. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:2, pp:261-266 [Journal]
    
11. Manindra Agrawal
    On the Isomorphism Conjecture for Weak Reducibilities. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:2, pp:267-282 [Journal]
    
12. Kevin J. Compton, Erich Grädel
    Logical Definability of Counting Functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:2, pp:283-297 [Journal]
    
13. Richard Chang
    On the Query Complexity of Clique Size and Maximum Satisfiability. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:2, pp:298-313 [Journal]