Equivalence of Measures of Complexity Classes (0)

Cached

Download Links

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

Active Bibliography

The Computational Complexity Column – Eric Allender Rutgers, Eric Allender, Jack H. Lutz, Elvira Mayordomo - 1998
90 The quantitative structure of exponential time – Jack H. Lutz - 1997
27 Effective fractal dimension: foundations and applications – John M. Hitchcock, Pavan Aduri, Clifford Bergman, Soumendra N. Lahiri, Giora Slutzki - 2003
Hard Instances of Hard Problems – Jack H. Lutz, Vikram Mhetre, Sridhar Srinivasan
7 Weakly Complete Problems are Not Rare – David W. Juedes - 1995
29 Pseudorandom Generators, Measure Theory, and Natural Proofs – W. Regan, D. Sivakumar, Jin-yi Cai - 1995
14 Weakly Hard Problems – Jack Lutz - 1994
18 Relative to a random oracle, NP is not small – Steven M. Kautz, Peter Bro Miltersen - 1994
79 Effective strong dimension in algorithmic information and computational complexity – Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo - 2004
Resource-Bounded Measure . . . – Klaus Ambos-Spies, et al.
56 Cook versus Karp-Levin: Separating Completeness Notions If NP Is Not Small – Jack H. Lutz, Elvira Mayordomo - 1992
93 The Dimensions of Individual Strings and Sequences – Jack H. Lutz - 2003
18 Recursive computational depth – James I. Lathrop, Jack H. Lutz - 1999
13 Computability and Measure – Sebastiaan Augustinus Terwijn - 1998
7 Effective Fractal Dimension in Algorithmic Information Theory – Elvira Mayordomo - 2006
12 Computational depth and reducibility – David W. Juedes, James I. Lathrop, Jack H. Lutz - 1994
2 One-Way Functions and Balanced NP – Jack H. Lutz
1 Complete Sets under Non-Adaptive Reductions are Scarce – Harry Buhrman, Dieter Van Melkebeek - 1997
3 Almost Complete Sets – Klaus Ambos-spies, Wolfgang Merkle, Jan Reimann, Sebastiaan A. Terwijn - 2000