Journal Article10.1137/0210057
Limitations on Separating Nondeterministic Complexity Classes
22
TL;DR: If the time bounds defining two nondeterministic complexity classes are too close for separation by the two known techniques, then they are almost too close to separation by any relativizable technique, implying $\operatorname{NSPACE}(\log n) = \operatORName{DSPACE})$.
read more
Abstract: If the time bounds defining two nondeterministic complexity classes are too close for separation by the two known techniques, then they are almost too close for separation by any relativizable technique. Proof of an analogous result for space would be a major breakthrough, implying $\operatorname{NSPACE}(\log n) = \operatorname{DSPACE}(\log n)$.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
The Complexity Theory Companion
Lane A. Hemaspaandra,Mitsunori Ogihara +1 more
- 01 Dec 2001
TL;DR: A Rogues' Gallery of Complexity Classes discusses the techniques used in the Polynomial Technique, which was developed in the second half of the 20th Century to address the problem of circularity in the rapidly changing environment.
200
How hard are sparse sets
Lane A. Hemachandra,M. Ogiwara,Osamu Watanabe +2 more
- 22 Jun 1992
TL;DR: The frontier of knowledge about the structural properties of sparse sets is explored and the strongest currently known results, together with the open problems that the results leave, are presented.
75
A survey of space complexity
TL;DR: The space complexity of RAMs is defined and its relation to usual classes is given, and three ways of relativizing complexity classes are examined.
40
A measure of relativized space which is faithful with respect to depth
Christopher B. Wilson
- 01 Jun 1988
TL;DR: A new measure of relativized space: the oracle stack is introduced, with this measure, NC1 ⊆ L holds for all oracles, as does NL⊆ NC3 (and NL ⊅ NC2 under certain circumstances).
30
Oracles versus Proof Techniques that Do Not Relativize
Eric Allender
- 01 Aug 1990
TL;DR: This paper reviews the status of nonrelativizing proof techniques, and argues that many oracle constructions still yield valuable information about problems in complexity theory.
23
References
Relationships between nondeterministic and deterministic tape complexities
TL;DR: The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a deterministic Turing machine is investigated and a specific set is produced, namely the set of all codings of threadable mazes, such that, if there is any set which distinguishes nondeter microscopic complexity classes from deterministic tape complexity classes, then this is one such set.
1.6K
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
TL;DR: Relativized versions of the open question of whether every language accepted nondeterministically in polynomial time can be recognized deterministic in poynomial time are investigated.
815
Separating Nondeterministic Time Complexity Classes
TL;DR: The strongest known dmgonalization results for both deterministic and nondetermlmstlc time complexity classes are reviewed and orgamzed for comparison with the results of the new padding technique.