A Note Concerning Nondeterministic Tape Complexities
Journal of the ACM (JACM)
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Indexing of subrecursive classes
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
On Sparse Sets in NP-P
Polynomial space polynomial delay algorithms for listing families of graphs
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
| Hi-index | 0.00 |
This paper investigates the structural properties of sets in NP-P and shows that the computational difficulty of lower density sets in NP depends explicitly on the relations between higher deterministic and nondeterministic time-bounded complexity classes. The paper exploits the recently discovered upward separation method, which shows for example that there exist sparse sets in NP-Pif and only if EXPTIME @@@@ NEXPTIME. In addition, the paper uses relativization techniques to determine logical possibilities, limitations of these proof techniques, and, for the first time, to exhibit structural differences between relativized NP and CoNP.