Josef M. Breutzmann, Jack H. Lutz  Home/Search
Context Related
| iastate.edu/~lutz/=PAPERS/emcc.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iastate.edu/~lutz/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The resource-bounded measures of complexity classes are shown to be robust with respect to certain changes in the underlying probability measure. Specifically, for any real number ffi ? 0, any uniformly polynomial-time computable sequence fi = (fi 0 ; fi 1 ; fi 2 ; : : : ) of real numbers (biases) fi i 2 [ffi; 1 \Gamma ffi], and any complexity class C (such as P, NP, BPP, P/Poly, PH, PSPACE, etc.) that is closed under positive, polynomial-time, truth-table reductions with queries of at... (Update)
Context of citations to this paper: More
.... a function d : f0; 1g [0; 1) such that for all w 2 f0; 1g ; d(w) 1 Gamma fi jwj )d(w0) fi jwj d(w1) The reader is referred to [30, 5] for discussion of this definition and its motivation. The success set of a fi martingale d is S 1 [d] n A 2 C fi fi fi (8k) 9w v...
.... incorporated by Schnorr [17, 19] into the theory of resource bounded randomness, and have recently been incorporated by Lutz and Breutzmann [9] into resource bounded measure. In our main theorem, we generalize (3) by proving that, for every time bound t : N N, every language...
Cited by: More
The Density of Weakly Complete Problems under Adaptive Reductions - Lutz, Zhao (Correct)
Effective Strong Dimension, Algorithmic.. - Athreya.. (2004) (Correct)
Genericity and Randomness over Feasible Probability Measures - Lorentz, Lutz (Correct)
Similar documents (at the sentence level):
70.5%: Equivalence of Measures of Complexity Classes - Breutzmann, Lutz (1996) (Correct)
Active bibliography (related documents): More All
0.6: Almost Everywhere High Nonuniform Complexity - Lutz (1992) (Correct)
0.5: The Quantitative Structure of Exponential Time - Lutz (1993) (Correct)
0.4: PSPACE Contains Almost Complete Problems - Powell (2003) (Correct)
Similar documents based on text: More All
0.4: Baire Category and Nowhere Dierentiability for Feasible.. - Breutzmann, Juedes, al. (Correct)
0.2: Bias Invariance of Small Upper Spans - Jack H. Lutz, Martin Strauss (Correct)
0.1: Query Order and NP-Completeness - Dai, Lutz (Correct)
Related documents from co-citation: More All
5: Almost everywhere high nonuniform complexity - Lutz - 1992
4: Theoretical Computer Science (context) - Juedes, Lathrop et al. - 1994
3: and the Density of Hard Languages (context) - Lutz, Mayordomo et al.
BibTeX entry: (Update)
J. M. Breutzmann and J. H. Lutz. Equivalence of measures of complexity classes. Submitted. http://citeseer.ist.psu.edu/702882.html More
@inproceedings{ breutzmann97equivalence,
author = "Josef M. Breutzmann and Jack H. Lutz",
title = "Equivalence of Measures of Complexity Classes",
booktitle = "Symposium on Theoretical Aspects of Computer Science",
pages = "535-545",
year = "1997",
url = "citeseer.ist.psu.edu/702882.html" }
Citations (may not include all citations):229 Theory of Recursive Functions and Effective Computability (context) - Rogers - 1967
142 Almost everywhere high nonuniform complexity - Lutz - 1992
71 The quantitative structure of exponential time - Lutz - 1993
65 The complexity of finite objects and the development of the .. (context) - Zvonkin, Levin - 1970
60 Measure and Category (context) - Oxtoby - 1980
58 Springer-Verlag (context) - Halmos - 1950
49 Almost every set in exponential time is P-bi-immune - Mayordomo - 1994
47 Zufalligkeit und Wahrscheinlichkeit (context) - Schnorr - 1971
42 The complexity and distribution of hard problems - Juedes, Lutz - 1995
40 Process complexity and effective random tests (context) - Schnorr - 1973
35 and the density of hard languages (context) - Lutz, Mayordomo et al. - 1994
33 A unified approach to the definition of random sequences (context) - Schnorr - 1971
33 Cook versus Karp-Levin: Separating completeness notions if N.. - Lutz, Mayordomo - 1997
29 Theoretical Computer Science (context) - Juedes, Lutz et al. - 1995
27 Soviet Mathematics Doklady (context) - Vovk, criterion - 1987
22 and natural proofs (context) - Regan, Sivakumar et al. - 1995
18 Weakly hard problems - Lutz - 1995
17 Klassifikation der Zufallsgesetze nach Komplexitat und Ordnu.. (context) - Schnorr - 1970
14 almost all (context) - Mehlhorn - 1974
13 Resource bounded randomness and weakly complete problems (context) - Ambos-Spies, Terwijn et al. - 1996
13 the equivalence of infinite product measures (context) - Kakutani - 1948
8 Department of Mathematics (context) - van Lambalgen, PhD - 1987
7 A comparison of weak completeness notions (context) - Ambos-Spies, Mayordomo et al. - 1996
4 Families of recursive predicates of measure zero (context) - Freidzon - 1972
2 and inseparable pairs (context) - Lutz, Mayordomo et al. - 1996
1 Wealy complete problems are not rare (context) - Juedes - 1996
1 Observations on measure and lowness for \Delta (context) - Lutz - 1996
1 Average time complexity classes - Cai, Selman - 1996
Documents on the same site (http://www.cs.iastate.edu/~lutz/papers.html): More
Observations on Measure and Lowness for . . . - Lutz (1996) (Correct)
A Small Span Theorem for P/Poly-Turing Reductions - Lutz (Correct)
Kolmogorov Complexity, Complexity Cores, and the Distribution.. - Juedes, Lutz (Correct)
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