Complexity and structure
Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Sparse sets lowness and highness
SIAM Journal on Computing
Does co-NP have short interactive proofs?
Information Processing Letters
On helping by robust oracle machines
Theoretical Computer Science
Graph isomorphism is in the low hierarchy
Journal of Computer and System Sciences
Theoretical Computer Science
Lower bounds for the low hierarchy
Journal of the ACM (JACM)
ICCI '93 Proceedings of the Fifth International Conference on Computing and Information
Locating P/poly Optimally in the Extended Low Hierarchy
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Open questions in the theory of semifeasible computation
ACM SIGACT News
| Hi-index | 0.00 |
This column gives a quick introduction to lowness theory [Sch83], which classifies the complexity of problems that are in NP but seem to be neither in P nor NP-complete.