Sparse sets in NP-P: relativizations

Authors:
Stuart A. Kurtz
Affiliations:
The Univ. of Chicago, Chicago, IL
Venue:
SIAM Journal on Computing
Year:
1985

Citing 0
Cited 2

NP might not be as easy as detecting unique solutions

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Generic oracles and oracle classes

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract