Equivalence of Measures of Complexity Classes (0)

Cached

Download Links

by Josef Breutzmann , Jack H. Lutz
Citations:70 - 19 self

Documents Related by Co-Citation

170 Almost Everywhere High Nonuniform Complexity – Jack H. Lutz - 1992
150 Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie – Claus-Peter Schnorr - 1971
334 The Definition of Random Sequences – Per Martin-Löf - 1966
1689 An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition – Ming Li, Paul Vitanyi - 1997
45 The Complexity and Distribution of Hard Problems – David W. Juedes, Jack H. Lutz - 1993
33 Resource-bounded measure – J H Lutz - 1998
25 On the notion of infinite pseudorandom sequences, Theoretical Computer Science 48 – K Ko - 1986
43 Measure, Stochasticity, and the Density of Hard Languages – Jack H. Lutz, Elvira Mayordomo - 1994
39 Contributions to the study of resource-bounded measure – E Mayordomo - 1994
160 On isomorphisms and density of NP and other complete sets – L Berman, J Hartmanis - 1977
87 The process complexity and effective random tests – C P Schnorr - 1973
51 Almost Every Set in Exponential Time is P-Bi-Immune – Elvira Mayordomo - 1994
89 A unified approach to the definition of a random sequence – C P Schnorr - 1971
53 P-printable sets – E Allender, R Rubinstein - 1986
19 The density and complexity of polynomial cores for intractable sets – P ORPONEN, U SCHNING - 1986
44 Generalized Kolmogorov complexity and the structure of feasible computations – J Hartmanis - 1983
333 A Theory of Program Size Formally Identical to Information Theory – Gregory J. Chaitin - 1975
56 Cook versus Karp-Levin: Separating Completeness Notions If NP Is Not Small – Jack H. Lutz, Elvira Mayordomo - 1992
90 The quantitative structure of exponential time – Jack H. Lutz - 1997