K. Ambos-Spies, H.-C. Neis, and S. A. Terwijn. Genericity and measure for exponential time. Theoretical Computer Science, 168(1):3--19, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Infinitely-Often Autoreducible Sets - Beigel, Fortnow, Stephan (2003) (2 citations) (Correct)
....bit whenever de ned. Balc azar and Mayordomo [7] observed that these sets are not in nitely often autoreducible. Fact 2.2 [7] There are sets which are not in nitely often autoreducible. In particular general generic sets have this property. On the other hand, Ambos Spies, Neis and Terwijn [5] showed that the notions of generic sets and resource bounded randomness are compatible. As random sets are in nitely often autoreducible (even in nitely often truth table autoreducible) 12, 13] there are some generic sets which are in nitely often autoreducible and Fact 2.2 really needs the ....
Klaus Ambos-Spies, Hans-Christian Neis and Sebastiaan A. Terwijn. Genericity and measure for exponential time. Theoretical Computer Science, 168:3-19, 1996.
Small Spans in Scaled Dimension - Hitchcock (2004) (Correct)
....Juedes and Lutz [10] noted that strengthening Theorem 1.1 from m reductions to reductions would achieve the separation BPP EXP. However, small span theorems for reductions of progressively increasing strength between have been obtained by Linder [11] Ambos Spies, Neis, and Terwijn [3], and Buhrman and van Melkebeek [6] Resource bounded dimension was introduced by Lutz [12] as an e#ectivization of Hausdor# dimension [7] to investigate the fractal structure of complexity classes. Just like resource bounded measure, resource bounded dimension is defined within suitable ....
....respect. For any i, j SST[i, j] be the assertion that for every A E, either or (j) E) 0. Let H m (E) Then E) 1, so dim E) 1 by Theorem 7.1, which in turn implies (P 1 m (H) E) 1. Therefore, SST[i, j] is true only if i or j # 3. Theorem 6. 3 asserts SST[1, 3], so the it cannot be improved to 2. We have the following corollary regarding the classes of complete sets for E, EXP, and NP. Corollary 7.3. Let 2. m(EXP) EXP) 1. E) 21 EXP) dim EXP) m(E) Then m(E) deg m (H)#E, so dim E) p (E) ....
K. Ambos-Spies, H.-C. Neis, and S. A. Terwijn. Genericity and measure for exponential time. Theoretical Computer Science, 168:3--19, 1996.
Resource Bounded Measure Bibliography - Hitchcock (2003) (1 citation) Self-citation (Terwijn) (Correct)
No context found.
K. Ambos-Spies, W. Merkle, J. Reimann, and S. A. Terwijn. Almost complete sets. Theoretical Computer Science, 306(1--3):177--194, 2003. 1
Strong Reductions and Immunity for Exponential Time - Schaefer, Stephan (2002) Self-citation (Time) (Correct)
No context found.
Klaus Ambos-Spies, Hans-Christian Neis, and Sebastiaan A. Terwijn. Genericity and measure for exponential time. Theoretical Computer Science, 168:3--19, 1996.
Strong Reductions and Immunity for Exponential Time - Schaefer, Stephan Self-citation (Time) (Correct)
No context found.
Klaus Ambos-Spies, Hans-Christian Neis and Sebastiaan A. Terwijn. Genericity and measure for exponential time. Theoretical Computer Science, 168:3--19, 1996.
Strong Reductions and Immunity for Exponential Time - Schaefer, Stephan Self-citation (Time) (Correct)
....predictions is met by A. Predicting quasi polynomially many values means that f predicts A(a x 1 ) up to A(a q(x) where q(x) 2 for some constant c. On the one hand, Ambos Spies [1] showed that no general Q generic set is Q random. On the other hand, every Q random set is still Q generic [3, 4] so that these two notions of genericity are di#erent. It follows from the definition that every Q generic set is EXP hyperimmune. Since any EXP avoiding set A contains only finitely many strings from the set # , one can easily show that A is not Q generic by considering a function which ....
Klaus Ambos-Spies, Hans-Christian Neis and Sebastiaan A. Terwijn. Genericity and measure for exponential time. Theoretical Computer Science, 168:3--19, 1996.
Resource-Bounded Measure Bibliography - Hitchcock (2003) (1 citation) Self-citation (Time) (Correct)
No context found.
K. Ambos-Spies, H.-C. Neis, and S. A. Terwijn. Genericity and measure for exponential time. Theoretical Computer Science, 168:3-19, 1996.
Scaled dimension and the Kolmogorov complexity of.. - Hitchcock.. (Correct)
No context found.
K. Ambos-Spies, H.-C. Neis, and S. A. Terwijn. Genericity and measure for exponential time. Theoretical Computer Science, 168(1):3--19, 1996.
An Interactive Proof System for Map Theory - Skalberg (2002) (Correct)
No context found.
Klaus Grue. Map theory. Theoretical Computer Science, 102(1):1-133, August 1992.
Infinitely-Often Autoreducible Sets - Beigel, Fortnow, Stephan (2003) (2 citations) (Correct)
No context found.
Klaus Ambos-Spies, Hans-Christian Neis and Sebastiaan A. Terwijn. Genericity and measure for exponential time. Theoretical Computer Science, 168:3--19, 1996. 15
Infinitely Often Autoreducible Sets - Beigel, Fortnow, Stephan (2002) (2 citations) (Correct)
No context found.
Klaus Ambos-Spies, Hans-Christian Neis and Sebastiaan A. Terwijn. Genericity and measure for exponential time. Theoretical Computer Science, 168:3--19, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC