The Boolean hierarchy I: structural properties
SIAM Journal on Computing
The polynomial time hierarchy collapses if the Boolean hierarchy collapses
SIAM Journal on Computing
The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
On quasilinear-time complexity theory
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
Satisfiability Is Quasilinear Complete in NQL
Journal of the ACM (JACM)
Nonerasing, counting, and majority over the linear time hierarchy
Information and Computation
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
On determinism versus non-determinism and related problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
On determinism versus non-determinism and related problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Logical Foundations of Proof Complexity
Logical Foundations of Proof Complexity
| Hi-index | 0.00 |
There is a single set that is complete for a variety of nondeterministic time complexity classes with respect to related versions of m-reducibility. This observation immediately leads to transfer results for determinism versus nondeterminism solutions. Also, an upward transfer of collapses of certain oracle hierarchies, built analogously to the polynomial-time or the linear-time hierarchies, can be shown by means of uniformly constructed sets that are complete for related levels of all these hierarchies. A similar result holds for difference hierarchies over nondeterministic complexity classes. Finally, we give an oracle set relative to which the nondeterministic classes coincide with the deterministic ones, for several sets of time bounds, and we prove that the strictness of the tape-number hierarchy for deterministic linear-time Turing machines does not relativize.