Journals in DBLP

J. Comput. Syst. Sci.
1989, volume: 39, number: 3

1. Klaus Ambos-Spies
   Honest Polynomial Time Reducibilities and the P = ? NP Problem. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1989, v:39, n:3, pp:250-281 [Journal]
   
2. Jim Kadin
   P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP. [Citation Graph (1, 0)][DBLP]
   J. Comput. Syst. Sci., 1989, v:39, n:3, pp:282-298 [Journal]
   
3. Lane A. Hemachandra
   The Strong Exponential Hierarchy Collapses. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1989, v:39, n:3, pp:299-322 [Journal]
   
4. Raymond Greenlaw
   Ordered Vertex Removal and Subgraph Problems. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1989, v:39, n:3, pp:323-342 [Journal]
   
5. Pierre America, Jan J. M. M. Rutten
   Solving Reflexive Domain Equations in a Category of Complete Metric Spaces. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1989, v:39, n:3, pp:343-375 [Journal]
   
6. A. G. Robinson, A. J. Goldman
   The Set Coincidence Game: Complexity, Attainability, and Symmetric Strategies. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1989, v:39, n:3, pp:376-387 [Journal]