On the Existence of Hard Sparse Sets under Weak Reductions

Authors:
Jin-yi Cai;Ashish V. Naik;D. Sivakumar
Affiliations:
-;-;-
Venue:
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Year:
1996

Six Hypotheses in Search of a Theorem

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Randomness and completeness in computational complexity

Randomness and completeness in computational complexity
Sparse sets, approximable sets, and parallel queries to NP

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Reducibility and completeness

Algorithms and theory of computation handbook
Online learning and resource-bounded dimension: winnow yields new lower bounds for hard sets

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

Hi-index	0.00