The Density of Weakly Complete Problems under Adaptive Reductions

Authors:
Jack H. Lutz;Yong Zhao
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
2000

Citing 0
Cited 3

The size of SPP

Theoretical Computer Science
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
Dimension, halfspaces, and the density of hard sets

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a real number $\alpha 2 is shown to be exponentially dense. This simultaneously strengthens the results of Lutz and Mayordomo (1994) and Fu (1995).