The Complexity of Sparse Sets in P

Authors:
Eric Allender
Affiliations:
-
Venue:
Proceedings of the Conference on Structure in Complexity Theory
Year:
1986

Citing 0
Cited 2

Quantum and classical complexity classes: separations, collapses, and closure properties

Information and Computation
If P ≠ NP then some strongly noninvertible functions are invertible

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract