NP is as easy as detecting unique solutions
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Algorithmic complexity in coding theory and the minimum distance problem
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Polynomial time quantum computation with advice
Information Processing Letters
On the reducibility of sets inside NP to sets with low information content
Journal of Computer and System Sciences
Foundations and Trends® in Theoretical Computer Science
The Shrinking Property for NP and coNP
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Nearly bounded error probabilistic sets
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
The shrinking property for NP and coNP
Theoretical Computer Science
Protecting data privacy through hard-to-reverse negative databases
ISC'06 Proceedings of the 9th international conference on Information Security
Theoretical Computer Science
Hi-index | 0.00 |