Almost-everywhere complexity hierarchies for nondeterministic time

12Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

We present an almost-everywhere complexity hierarchy for nondeterministic time, and show that it is essentially the best result of this sort that can be proved using relativizable proof techniques. © 1993.

Cite

CITATION STYLE

APA

Allender, E., Beigel, R., Hertrampf, U., & Homer, S. (1993). Almost-everywhere complexity hierarchies for nondeterministic time. Theoretical Computer Science, 115(2), 225–241. https://doi.org/10.1016/0304-3975(93)90117-C

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free