Small Spans in Scaled Dimension

Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time, either the class of languages reducible to A (the lower span) or the class of problems to which A can be reduced (the upper span) is small in the sense of resource-bounded measure and, in particular, that the degree of A is small. Small span theorems have been proven for increasingly stronger polynomial-time reductions, and a small span theorem for polynomial-time Turing reductions would imply BPP = EXP. In contrast to the progress in resource-bounded measure, Ambos-Spies, Merkle, Reimann, and Stephan (2001) showed that there is no small span theorem for the resource-bounded dimension of Lutz (2003), even for polynomial-time many-one reductions. Resource-bounded scaled dimension, recently introduced by Hitchcock, Lutz, and Mayordomo (2004), provides rescalings of resource-bounded dimension. We use scaled dim...

• Type: Conference
• Year: 2004
• Where: COCO
• Authors: John M. Hitchcock
• Keywords: -order Scaled Dimension, Algorithms, COCO 2004, Polynomial-time Many-one Reductions, Small Span Theorem