Eric Allender, Michael C. Loui, Kenneth W. Regan  Home/Search
Context Related
| rutgers.edu/pub/allender...ALRch35.ps.Z rutgers.edu/pub/dimacs/Te...9825.ps.gz 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: rutgers.edu/~allender/publicat... (more) From: rutgers.edu/TechnicalRepor...1998 (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Introduction In the previous two chapters, we have ffl introduced the basic complexity classes, ffl summarized the known relationships between these classes, and ffl seen how reducibility and completeness can be used to establish tight links between natural computational problems and complexity classes. Some natural problems seem not to be complete for any of the complexity classes we have seen so far. For example, consider the problem of taking as input a graph G and a number k, and deciding... (Update)
Context of citations to this paper: More
.... of the topics introduced here may wish to consult books such as [HU79, BDG95, BDG90, Vol99, Pap94, DK00] or survey chapters such as [ALR99, BS90] To illustrate what we would like complexity theory to do, it may be best to start by considering a dream result that complexity...
Cited by: More
Basic Complexity - Allender, McCartin (Correct)
Similar documents (at the sentence level):
56.2%: Other Complexity Classes and Measures - Allender, Loui, Regan (1999) (Correct)
17.9%: Complexity Theory - Allender, Loui, Regan (2004) (Correct)
Active bibliography (related documents): More All
0.3: Teaching Computational Complexity: Resources to Treasure - Hemaspaandra (1994) (Correct)
0.3: On The Power Of One-Way Globally Deterministic Synchronized.. - Slobodová (Correct)
0.3: Towards the Notion of Stability of Approximation.. - Böckenhauer.. (1999) (Correct)
Similar documents based on text: More All
0.4: Complexity Classes - Allender, Loui, Regan (Correct)
0.2: Reducibility and Completeness - Allender, Loui, Regan (1999) (Correct)
0.1: A Probabilistic-Time Hierarchy Theorem for "Slightly Non-Uniform".. - Barak (2002) (Correct)
Related documents from co-citation: More All
2: Computational complexity and the existence of complexity gaps (context) - Borodin - 1972
BibTeX entry: (Update)
E. Allender, M. Loui, and K. R. Regan. Three chapters: 27 (Complexity classes), 28 (Reducibility and completeness), and 29 (Other complexity classes and measures). In M. J. Atallah, editor, Algorithms and Theory of Computation Handbook. CRC Press, 1999. http://citeseer.ist.psu.edu/article/allender99other.html More
@techreport{ allender98other,
author = "Eric Allender and Michael C. Loui and Kenneth W. Regan",
title = "Other Complexity Classes and Measures",
number = "98-25",
month = "11,",
year = "1998",
url = "citeseer.ist.psu.edu/article/allender99other.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1994
660 An Introduction to Kolmogorov Complexity and its Application.. - Li, Vit'anyi - 1993
531 The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1989
403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992
370 A mathematical introduction to logic (context) - Enderton - 1972
251 The complexity of computing the permanent (context) - Valiant - 1979
242 Nondeterministic exponential time has two-prover interactive.. - Babai, Fortnow et al. - 1991
222 Fixed-parameter tractability and completeness I: Basic theor.. - Downey, Fellows - 1995
210 Generalized first-order spectra and polynomial-time recogniz.. (context) - Fagin - 1974
203 Approximating clique is almost NP-complete (context) - Feige, Goldwasser et al. - 1991
198 Structure and complexity of relational queries - Chandra, Harel - 1982
172 Algebraic methods for interactive proof systems - Lund, Fortnow et al. - 1992
151 The complexity of optimization problems (context) - Krentel - 1988
145 Computational complexity of probabilistic Turing machines (context) - Gill - 1977
127 Counter-Free Automata (context) - McNaughton, Papert - 1971
126 PP is as hard as the polynomial-time hierarchy (context) - Toda - 1991
124 Datalog extensions for database queries and updates (context) - Abiteboul, Vianu - 1991
100 Weak second-order arithmetic and finite automata (context) - Buchi - 1960
99 Handbook of Theoretical Computer Science (context) - van Leeuwen - 1990
94 Interactive proofs and the hardness of approximating cliques - Feige, Goldwasser et al. - 1996
87 Arthur-Merlin games: A randomized proof system (context) - Babai, Moran - 1988
85 Turing machines that take advice (context) - Karp, Lipton - 1982
71 The quantitative structure of exponential time - Lutz - 1997
70 Two theorems on random polynomial time (context) - Adleman - 1978
70 Introduction to the Theory of Complexity (context) - Bovet, Crescenzi - 1994
69 The polynomial time hierarchy (context) - Stockmeyer - 1976
69 requires exponential circuits: Derandomizing the XOR Lemma (context) - Impagliazzo, Wigderson et al. - 1997
61 Descriptive and computational complexity - Immerman - 1989
60 On uniformity within NC (context) - Barrington, Immerman et al. - 1990
52 A very hard log-space counting class (context) - Alvarez, Jenner - 1993
48 Borel sets and circuit complexity (context) - Sipser - 1983
46 Finite model theory---a personal perspective - Fagin - 1993
46 Counting auxiliary pushdown automata and semi-unbounded arit.. (context) - Vinay - 1991
43 On finite monoids having only trivial subgroups (context) - Schutzenberger - 1965
43 Computing with first-order logic - Abiteboul, Vianu - 1995
39 and some facets of complexity (context) - Papadimitriou, Yannakakis et al. - 1984
37 Probabilistic checking of proofs (context) - Arora, Safra - 1992
32 Classifying the computational complexity of problems (context) - Stockmeyer - 1987
32 Average-case computational complexity theory - Wang - 1997
28 Computational Complexity (context) - Wagner, Wechsung - 1986
20 Complexity classes and theories of finite models (context) - Lynch - 1982
18 Are there interactive protocols for co-NP languages - Fortnow, Sipser - 1988
17 Turing machines and the spectra of first-order formulas (context) - Jones, Selman - 1974
16 The history and status of the P versus NP question - Sipser - 1992
13 The permanent requires large uniform threshold circuits - Allender - 1997
10 On relativization and the existence of complete sets (context) - Sipser - 1982
8 BPP and the polynomial hierarchy (context) - Lautemann - 1983
6 On computational complexity and the nature of computer scien.. (context) - Hartmanis - 1994
4 The complexity of matrix transposition on one-tape off-line .. (context) - Dietzfelbinger, Maass et al. - 1991
4 A note on complete problems for complexity classes (context) - Ambos-Spies - 1986
3 Computational Complexity Theory (context) - Hartmanis - 1989
3 Unpublished manuscript (context) - Lindell, define et al. - 1994
2 Juris Hartmanis: the beginnings of computational complexity (context) - Stearns - 1990
Documents on the same site (http://www.cs.rutgers.edu/~allender/publications/): More
Measure on Small Complexity Classes, with Applications for .. - Eric Allender, Martin.. (1994) (Correct)
The Complexity of Matrix Rank and Feasible Systems of.. - Allender, Beals, Ogihara (1996) (Correct)
Relating Equivalence And Reducibility To Sparse Sets - Allender, Hemachandra.. (1992) (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