Luca Trevisan  Home/Search
Context
Related
| berkeley.edu/~luca...mplexitynotes02.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: berkeley.edu/~luca/cs278...#notes (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Contents 1 Introduction, P and NP 7 1.1 Computational Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.2 P and NP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.3 NP-completeness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.3.1 Reductions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.3.2 NP-completeness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.3.3 An NP-complete problem . .... (Update)
Active bibliography (related documents): More All
1.2: CS278: Computational Complexity - Spring These Are (Correct)
1.2: Some Applications of Coding Theory in Computational Complexity - Trevisan (2004) (Correct)
0.8: The Computational Complexity Column - Lance Fortnow Nec (Correct)
Similar documents based on text: More All
0.4: Approximate Classification via Earthmover Metrics - Archer, Fakcharoenphol.. (2004) (Correct)
0.2: Power-aware Base Station Positioning for Sensor Networks - Bogdanov, Maneva, Riesenfeld (2004) (Correct)
0.2: Unknown - Cantly For Providing (Correct)
BibTeX entry: (Update)
@misc{ trevisan-lecture,
author = "Luca Trevisan",
title = "Lecture Notes on Computational Complexity",
url = "citeseer.ist.psu.edu/trevisan04lecture.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1994
773 Reducibility among combinatorial problems (context) - Karp - 1972
534 The complexity of theorem proving procedures (context) - Cook - 1971
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. - 1998
291 Theoretical Computer Science (context) - Haken, of - 1985
212 Probabilistic checking of proofs: A new characterization of .. - Arora, Safra - 1998
189 Algebraic methods in the theory of lower bounds for boolean .. (context) - Smolensky - 1987
173 Trading group theory for randomness (context) - Babai - 1985
172 Algebraic methods for interactive proof systems - Lund, Fortnow et al. - 1992
170 Nondeterministic space is closed under complementation - Immerman - 1988
149 Fast probabilistic algorithms for verification of polynomial.. (context) - Schwartz - 1980
145 Random generation of combinatorial structures from a uniform.. (context) - Jerrum, Valiant et al. - 1986
145 Computational complexity of probabilistic Turing machines (context) - Gill - 1977
140 Decoding of Reed-Solomon codes beyond the error-correction b.. - Sudan - 1997
132 Hiding instances in multioracle queries (context) - Beaver, Feigenbaum - 1990
132 Relationships between nondeterministic and deterministic tap.. (context) - Savitch - 1970
129 Theoretical Computer Science (context) - Stockmeyer, hierarchy - 1976
118 A parallel repetition theorem - Raz - 1998
116 Some connections between nonuniform and uniform complexity c.. (context) - Karp, Lipton - 1980
112 Average case complete problems (context) - Levin - 1986
98 Private coins versus public coins in interactive proof syste.. (context) - Goldwasser, Sipser - 1986
94 Self testingcorrecting with application to numerical problem - Luby, testing et al. - 1993
94 Interactive proofs and the hardness of approximating cliques - Feige, Goldwasser et al. - 1996
90 A pseudorandom generator from any one-way function - Hastad, Impagliazzo et al. - 1999
87 Arthur-Merlin games: a randomized proof system (context) - Babai, Moran - 1988
84 Mathematical Systems Theory (context) - Furst, Saxe et al. - 1984
83 BPP has subexponential time simulations unless EXPTIME has p.. - Babai, Fortnow et al. - 1993
70 Two theorems on random polynomial time (context) - Adleman - 1978
68 One-way functions and pseudorandom generators (context) - Levin - 1987
68 Hardness vs randomness (context) - Nisan, Wigderson - 1994
64 Pseudorandom generators without the XOR lemma - Sudan, Trevisan et al. - 2001
57 Electronic Colloquium on Computational Complexity (context) - Goldreich, Nisan et al. - 1995
57 the computational complexity of algorithms (context) - Hartmanis, Stearns - 1965
56 Proofs that yield nothing but their validity (context) - Goldreich, Micali et al. - 1991
54 Lower bounds on the size of bounded depth networks over a co.. (context) - Razborov - 1987
49 Clique is hard to approximate within n - Hastad - 1999
47 Equivalence of free boolean graphs can be decided probabilis.. (context) - Blum, Chandra et al. - 1980
47 Extracting all the randomness and reducing the error in Trev.. - Raz, Reingold et al. - 1999
47 the random-self-reducibility of complete sets - Feigenbaum, Fortnow - 1993
44 PCP's and nonapproximability -- towards tight results (context) - Bellare, Goldreich et al. - 1998
43 Selftesting /correcting for polynomials and for approximate .. - Gemmell, Lipton et al. - 1991
42 Hard-core distributions for somewhat hard problems - Impagliazzo - 1995
37 No better ways to generate hard NP instances than picking un.. (context) - Impagliazzo, Levin - 1990
37 Information Processing Letters (context) - Lautemann, the - 1983
31 Extracting randomness: How and why (context) - Nisan - 1996
29 the theory of average case complexity - Ben-David, Chor et al. - 1992
27 Some optimal inapproximability results - Hastad - 2001
24 The complexity of approximate counting (context) - Stockmeyer - 1983
24 Near-optimal conversion of hardness into pseudo-randomness - Impagliazzo, Shaltiel et al. - 1999
22 A personal view of average-case complexity (context) - Impagliazzo - 1995
22 approximation algorithm for MAX 3SAT (context) - Karlo, Zwick - 1997
21 Extractors and pseudo-random generators with optimal seed le.. - Impagliazzo, Shaltiel et al. - 2000
20 Weak random sources (context) - Andreev, Clementi et al. - 1999
19 A new general derandomization method (context) - Andreev, Clementi et al. - 1998
17 Simple extractors for all min-entropies and a new pseudo-ran.. (context) - Shaltiel, Umans - 2001
16 Derandomizing Arthur-Merlin games using hitting sets - Miltersen, Vinodchandran - 1999
15 A hierarchy for nondeterministic time complexity (context) - Cook - 1973
15 Almost optimal lower bounds for small depth circuits - Hastad - 1986
10 Improved derandomization of BPP using a hitting set generato.. - Goldreich, Wigderson - 1999
10 One-sided versus two-sided error in probabilistic computatio.. - Buhrman, Fortnow - 1999
8 Linearity testing over characteristic two (context) - Bellare, Coppersmith et al. - 1996
8 has sub-exponential circuits (context) - Impagliazzo, Wigderson et al. - 1997
8 Computational Complexity (context) - Nisan - 1994
7 Ta-Shma (context) - Armoni - 1997
6 Notes on Levin's theory of average-case complexity (context) - Goldreich - 1997
5 Worst-case hardness su#ces for derandomization: A new method.. (context) - Andreev, Clementi et al. - 1999
4 Short proofs are narrow: Resolution made simple - Ben-Sasson, Wigderson - 2001
4 Randomness versus time: De-randomization under a uniform ass.. (context) - Impagliazzo, Wigderson - 1998
3 Preliminary version (context) - Shamir, PSPACE et al. - 1992
2 Undirected connectivity (context) - Nisan, Szemeredi et al. - 1992
2 Problemi Peredachi Informatsii (context) - Levin, problems - 1973
2 cient checking of computations (context) - Lipton - 1990
1 Optimal bounds for the approximation of boolean functions an.. (context) - Andreev, Clementi et al. - 1997
1 A complexity theoretic apprach to randomness (context) - Sipser - 1983
Documents on the same site (http://www.cs.berkeley.edu/~luca/cs278/#notes):
CS278: Computational Complexity - Spring These Are (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