David W. Juedes, Jack H. Lutz  Home/Search
Context Related
| iastate.edu/~lutz/=PAPERS/p16.ps iastate.edu/~lutz/=PAPERS/cdhp.ps uchicago.edu/~naik/course...paper4.ps.Z 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: Measure-theoretic aspects of the P m -reducibility structure of the exponential time complexity classes E=DTIME(2 linear ) and E 2 = DTIME(2 polynomial ) are investigated. Particular attention is given to the complexity (measured by the size of complexity cores) and distribution (abundance in the sense of measure) of languages that are P m - hard for E and other complexity classes. Tight upper and lower bounds on the size of complexity cores of hard languages are derived. The upper... (Update)
Cited by: More
Observations on Measure and Lowness for Δ_2^p - Lutz (Correct)
Hard Instances of Hard Problems - Lutz, Mhetre, Srinivasan (Correct)
Scaled dimension and the Kolmogorov complexity of.. - Hitchcock.. (Correct)
Similar documents (at the sentence level): More
11.6%: Cook versus Karp-Levin: Separating Completeness Notions If NP .. - Lutz, Mayordomo (1992) (Correct)
10.4%: The Quantitative Structure of Exponential Time - Lutz (1993) (Correct)
8.8%: Kolmogorov Complexity, Complexity Cores, and the Distribution.. - Juedes, Lutz (Correct)
Active bibliography (related documents): More All
0.1: Resource-Bounded Measure and Randomness - Ambos-Spies, Mayordomo (1997) (Correct)
0.0: An Observation on Probability versus Randomness with.. - Book, Lutz, Wagner (1993) (Correct)
0.0: Measure One Results In Computational Complexity Theory - Vollmer, Wagner (1997) (Correct)
Similar documents based on text: More All
0.3: Genericity and Measure for Exponential Time - Ambos-Spies, Neis, Terwijn (Correct)
0.3: Weakly Useful Sequences - Stephen Fenner And (1994) (Correct)
0.2: Weak Completeness in E and E 2 * - Juedes, Lutz (1995) (Correct)
Related documents from co-citation: More All
34: Almost everywhere high nonuniform complexity - Lutz - 1992
29: The quantitative structure of exponential time - Lutz - 1993
22: Almost every set in exponential time is p-bi-immune - Mayordomo - 1994
BibTeX entry: (Update)
D. Juedes and J. Lutz, The complexity and distribution of hard problems, Proc. 34th FOCS Conference, pp. 177-- 185, 1993. http://citeseer.ist.psu.edu/juedes93complexity.html More
@article{ juedes95complexity,
author = "David W. Juedes and Jack H. Lutz",
title = "The Complexity and Distribution of Hard Problems",
journal = "SIAM Journal on Computing",
volume = "24",
number = "2",
pages = "279--295",
year = "1995",
url = "citeseer.ist.psu.edu/juedes93complexity.html" }
Citations (may not include all citations):167 Structural Complexity (context) - Balc'azar, D'iaz et al. - 1988
109 Relative to a random oracle (context) - Bennett, Gill
43 Structural Complexity II (context) - Balc'azar, D'iaz et al. - 1990
29 Bi-immune sets for complexity classes (context) - Balc'azar, Schoning - 1985
20 and polynomial reducibilities (context) - Ambos-Spies, relativizations - 1986
The graph only includes citing articles where the year of publication is known.
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