Jack H. Lutz  Home/Search
Context Related
| iastate.edu/techreports/TR9608.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/techreport...catalog (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Recent results on the internal, measure-theoretic structure of the exponential time complexity classes E and EXP are surveyed. The measure structure of these classes is seen to interact in informative ways with bi-immunity, complexity cores, polynomial-time reductions, completeness, circuit-size complexity, Kolmogorov complexity, natural proofs, pseudorandom generators, the density of hard languages, randomized complexity, and lowness. Possible implications for the structure of NP are also... (Update)
Cited by: More
Observations on Measure and Lowness for Δ_2^p - Lutz (Correct)
Hard Instances of Hard Problems - Lutz, Mhetre, Srinivasan (Correct)
Equivalence of Measures of Complexity Classes - Breutzmann, Lutz (Correct)
Similar documents (at the sentence level):
43.8%: The Quantitative Structure of Exponential Time - Lutz (1993) (Correct)
6.8%: The Complexity and Distribution of Hard Problems - Juedes, Lutz (1993) (Correct)
5.9%: Cook versus Karp-Levin: Separating Completeness Notions If NP .. - Lutz, Mayordomo (1992) (Correct)
Active bibliography (related documents): More All
1.1: Genericity and Randomness over Feasible Probability Measures - Lorentz, Lutz (Correct)
0.9: Complete Sets and Structure in Subrecursive Classes - Buhrman, Torenvliet (1998) (Correct)
0.7: Average-Case Complexity Theory and Polynomial-Time Reductions - Pavan (2001) (Correct)
Similar documents based on text: More All
0.1: Measure on Small Complexity Classes, with Applications for .. - Eric Allender, Martin.. (1994) (Correct)
0.1: A Comparison of Weak Completeness Notions (Extended.. - Ambos-Spies, Majordomo, al. (Correct)
0.1: On Pseudorandomness and Resource-Bounded Measure - Arvind, Köbler (1997) (Correct)
Related documents from co-citation: More All
56: Almost everywhere high nonuniform complexity - Lutz - 1992
29: The complexity and distribution of hard problems - Juedes, Lutz - 1993
21: Almost every set in exponential time is p-bi-immune - Mayordomo - 1994
BibTeX entry: (Update)
J. H. Lutz, The quantitative structure of exponential time, in: Proc. 8th Structure in Complexity Theory Conference (IEEE Comput. Soc. Press, 1993) 158-175. http://citeseer.ist.psu.edu/article/lutz93quantitative.html More
@incollection{ lutz97quantitative,
author = "Jack H. Lutz",
title = "The Quantitative Structure of Exponential Time",
booktitle = "Alan L. Selman, Editor, Complexity Theory Retrospective, In Honor of Juris Hartmanis on the Occasion of His Sixtieth Birthday, July 5, 1988",
volume = "2",
year = "1997",
url = "citeseer.ist.psu.edu/article/lutz93quantitative.html" }
Citations (may not include all citations):1447 A mathematical theory of communication (context) - Shannon - 1948
957 The Probabilistic Method (context) - Alon, Spencer - 1992
773 Reducibility among combinatorial problems (context) - Karp - 1972
660 An Introduction to Kolmogorov Complexity and its Application.. - Li, Vit'anyi - 1993
534 The complexity of theorem proving procedures (context) - Cook - 1971
339 Theory and applications of trapdoor functions (context) - Yao - 1982
142 Almost everywhere high nonuniform complexity - Lutz - 1992
139 Ten Lectures on the Probabilistic Method (context) - Spencer - 1987
128 A complexity-theoretic approach to randomness (context) - Sipser - 1983
126 On isomorphism and density of NP and other complete sets (context) - Berman, Hartmanis - 1977
122 A comparison of polynomial-time reducibilities (context) - Ladner, Lynch et al. - 1975
73 and the behavior of polynomial time reducibilities on NP (context) - Selman, tally - 1979
70 Sparse complete sets for NP: Solution of a conjecture of Ber.. (context) - Mahaney - 1982
67 The synthesis of two-terminal switching circuits (context) - Shannon - 1949
61 Natural proofs - Razborov, Rudich - 1994
60 Measure and Category (context) - Oxtoby - 1980
58 Springer-Verlag (context) - Halmos - 1950
57 Probabilistic Methods in Combinatorics - Erdos, Spencer - 1974
57 Oracles and queries that are sufficient for exact learning - Bshouty, Cleve et al. - 1994
49 Almost every set in exponential time is P-biimmune - Mayordomo - 1994
45 Category and measure in complexity classes (context) - Lutz - 1990
44 Relativized circuit complexity (context) - Wilson - 1985
43 Structural Complexity II (context) - Balc'azar, D'iaz et al. - 1990
43 Unprovability of lower bounds on circuit size in certain fra.. (context) - Razborov
42 The complexity and distribution of hard problems - Juedes, Lutz - 1995
40 Process complexity and effective random tests (context) - Schnorr - 1973
37 Information Processing Letters (context) - Lautemann, the - 1983
35 and the density of hard languages (context) - Lutz, Mayordomo et al. - 1994
33 Transactions of the American Mathematical Society (context) - Hartmanis, Stearns et al. - 1965
33 Contributions to the Study of ResourceBounded Measure - Mayordomo - 1994
33 Cook versus Karp-Levin: Separating completeness notions if N.. - Lutz, Mayordomo - 1994
33 A unified approach to the definition of random sequences (context) - Schnorr - 1971
32 Hardness vs (context) - Nisan, Wigderson - 1988
30 Resource-bounded measure (context) - Lutz
29 Theoretical Computer Science (context) - Juedes, Lutz et al. - 1995
29 Bi-immune sets for complexity classes (context) - Balc'azar, Schoning - 1985
28 A comparison of polynomial time completeness notions (context) - Watanabe - 1987
27 Resourcebounded randomness and weakly complete problems (context) - Ambos-Spies, Terwijn et al.
27 Soviet Mathematics Doklady (context) - Levin, notion et al. - 1973
26 Bulletin of the American Mathematical Society (context) - Church, concept et al. - 1940
25 The complexity of decision versus search - Bellare, Goldwasser - 1994
23 Provably difficult combinatorial games (context) - Stockmeyer, Chandra - 1979
23 New collapse consequences of NP having small circuits (context) - Kobler, Watanabe - 1995
22 and natural proofs (context) - Regan, Sivakumar et al. - 1995
22 Theoretical Computer Science (context) - Ambos-Spies, Neis et al.
20 and polynomial reducibilities (context) - Ambos-Spies, relativizations - 1986
19 On reducibility to complex or sparse sets (context) - Lynch - 1975
19 Complete sets and closeness to complexity classes (context) - Schoning - 1986
18 Weakly hard problems - Lutz - 1995
17 Klassifikation der Zufallsgesetze nach Komplexit at und Ordn.. (context) - Schnorr - 1970
17 Measure on small complexity classes with applications for BP.. - Allender, Strauss - 1994
17 Fine separation of average time complexity classes - Cai, Selman - 1996
17 Notions of resource-bounded category and genericity (context) - Fenner - 1991
17 The density and complexity of polynomial cores for intractab.. (context) - Orponen, Schoning - 1986
16 Robustness of the notion (context) - Allender, Strauss - 1995
16 Relative to a random oracle (context) - Kautz, Miltersen - 1994
15 The Graph Isomorphism Problem (context) - Kobler, Schoning et al. - 1993
15 the structure of complete sets: Almost everywhere complexity.. (context) - Berman - 1976
14 almost all (context) - Mehlhorn - 1974
14 Can an individual sequence of zeros and ones be random (context) - Uspenskii, Semenov et al. - 1990
13 Resource-bounded genericity (context) - Ambos-Spies - 1995
13 the Structure of Intractable Complexity Classes (context) - Watanabe - 1987
13 Resource-bounded balanced genericity (context) - Ambos-Spies, Mayordomo et al. - 1996
12 Observations on measure and lowness for \Delta P (context) - Lutz - 1996
12 Cook reducibility is faster than Karp reducibility in NP (context) - Longpr'e, Young - 1990
12 approximation and density (context) - Ko, Moore - 1975
11 An excursion to the Kolmogorov random strings - Buhrman, Mayordomo - 1995
11 Using Hard Problems to Create Pseudorandom Generators (context) - Nisan - 1992
9 EXP is not polynomial time Turing reducible to sparse sets (context) - Fu, queries - 1995
9 Some observations about the randomness of hard problems (context) - Huynh - 1986
9 Weakly complete problems are not rare - Juedes - 1995
9 Translated in Theory of Probability and its Applications (context) - Kolmogorov, Uspenskii et al. - 1987
8 Improved resource-bounded Borel-Cantelli and stochasticity t.. - Regan, Sivakumar - 1995
8 The Complexity and Distribution of Computationally Useful Pr.. (context) - Juedes - 1994
8 On polynomial time Turing and many-one completeness in PSPAC.. (context) - Watanabe, Tang - 1992
8 Measuring in PSPACE - Mayordomo - 1994
8 On polynomial bounded truthtable reducibility of NP sets to .. (context) - Ogiwara, Watanabe - 1991
7 Diagonalizing over deterministic polynomial time (context) - Ambos-Spies, Fleischhack et al. - 1988
7 Complexity and Structure (context) - Schoning - 1986
7 Structural properties of nondeterministic complete sets (context) - Homer - 1990
6 Completeness for nondeterministic complexity classes - Buhrman, Homer et al. - 1991
6 A note on genericity and bi-immunity (context) - Balc'azar, Mayordomo - 1995
5 Some structural properties of polynomial reducibilities and .. (context) - Young - 1983
4 Journal of the Association of Computing Machinery (context) - Ko, Orponen et al. - 1994
2 Resource-bounded category: a stronger approach (context) - Fenner - 1995
2 and Truth (context) - von Mises, Statistics - 1939
1 The Quantitative Structure of Exponential Time (context) - Balc'azar, D'iaz et al. - 1995
1 The Quantitative Structure of Exponential Time (context) - Erdos, on et al. - 1947
1 The Quantitative Structure of Exponential Time (context) - Schnorr, Wahrscheinlichkeit et al. - 1971
1 Diagonalizing over polynomial time computable sets (context) - Ambos-Spies, Fleischhack et al. - 1987
1 Compressibility and resource bounded measure (context) - Burman, Longpr'e - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.iastate.edu/tech-reports/catalog.html): More
Protective Interface Specifications - Leavens, Wing (1997) (Correct)
Stochastic Analysis of Periodic Timed Data Flow Diagrams with.. - Symanzik (1996) (Correct)
Weak Behavioral Subtyping for Types with Mutable Objects - Dhara, Leavens (1994) (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