External Links

    Journal: J. Comput. Syst. Sci.

    Volume 39, Issue 3

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