P-selective sets and reducing search to decision vs. self-reducibility

Authors:
Edith Hemaspaandra;Ashish V. Naik;Mitsunori Ogihara;Alan L. Selman
Affiliations:
-;-;-;-
Venue:
Journal of Computer and System Sciences
Year:
1996

Citing 0
Cited 10

Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions

Theoretical Computer Science - Algorithmic learning theory
Partial information classes

ACM SIGACT News
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Algebraic Properties for P-Selectivity

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Cryptographic Limitations on Parallelizing Membership and Equivalence Queries with Applications to Random Self-Reductions

ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
SIGACT news complexity theory column 40

ACM SIGACT News
Reductions between disjoint NP-pairs

Information and Computation
Open questions in the theory of semifeasible computation

ACM SIGACT News
On basing one-way functions on NP-hardness

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Reductions between disjoint NP-Pairs

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract