Containment, Separation, Complete Sets, and Immunity of Complexity Classes

@inproceedings{Hartmanis1986ContainmentSC,
  title={Containment, Separation, Complete Sets, and Immunity of Complexity Classes},
  author={Juris Hartmanis and Ming Li and Yaacov Yesha},
  booktitle={ICALP},
  year={1986}
}

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

The Structural Complexity Column: Some Observations about Relativization of Space Bounded Computations, Bulletin of the European Association for

Theoretical Computer Science (EATCS) • 1988

Robustness and the Non-Isomorphism of NP-Complete Problems

One-Way Functions
Proc. Structure in Complexity Theory • 1987

Some Observations about NP Complete Sets, Fundamentals of Computation Theory FCT'87

Some Observations about NP Complete Sets, Fundamentals of Computation Theory FCT'87 • 1987

The Structural Complexity Column: Sparse Complete Sets for NP and the Optimal Collapse of the Polynomial Hierarchy

Bulletin of the European Association for Theoretical Computer Science (EATCS) • 1987

The Structural Complexity Column: The Collapsing Hierarchies, Bulletin of the European Association for

Theoretical Computer Science (EATCS) • 1987

Theoretical Computer Science 4th GI Conference

Lecture Notes in Computer Science • 1979

The Structure of the Complexity of Computations: A Guided Tour Through Complexity Classes

R Chang, B Chor, +3 authors P Rohatgi
The Random Oracle Hypothesis Is False Proc. 13th World Computer Congress 94 • 1944

Similar Papers

Loading similar papers…