Computational Complexity: A Conceptual Perspective

Computational Complexity: A Conceptual Perspective (2006)

Cached

Download Links

[www.wisdom.weizmann.ac.il]

Other Repositories/Bibliography

DBLP

by Oded Goldreich

Citations:

30 - 10 self

BibTeX

@MISC{Goldreich06computationalcomplexity:,
    author = {Oded Goldreich},
    title = {Computational Complexity: A Conceptual Perspective},
    year = {2006}
}

Bookmark

OpenURL

Abstract

Citations

3376	Introduction to Automata Theory Languages and Computation. 2nd edition. Addison-Wesley Publishing Company, 2000. de - Hopcroft, Ullman - 2004
2506	A method for obtaining digital signatures and public-key cryptosystems - Rivest, Shamir, et al.
1605	The Theory of Error-Correcting Codes - MacWilliams, Sloane - 1978
1566	Randomized Algorithms - MOTWANI, RAGHAVAN - 1995
1412	An Introduction to Kolmogorov Complexity and Its Applications - Li, Vitányi - 1993
1206	Introduction to Parallel Algorithms and Architectures: Arrays - Leighton - 1992
1117	Reducability Among Combinatorial Problems - Karp - 1972
1001	Probabilistic encryption - Goldwasser, Micali - 1984
892	C.: The knowledge complexity of interactive proof-systems (extended abstract - Goldwasser, Micali, et al. - 1985
711	A digital signature scheme secure against adaptive chosenmessage attacks - Goldwasser, Micali, et al. - 1988
601	A pseudorandom generator from any one-way function - H˚astad, Impagliazzo, et al. - 1999
561	Some optimal inapproximability results - Hastad - 2001
536	Communication complexity - Kushilevitz, Nisan - 1997
507	An Introduction to Computational Learning Theory - Kearns, Vazirani - 1994
425	How to play any mental game, or a completeness theorem for protocols with honest majority - Goldreich, Micali, et al. - 1987
413	Introduction to the Theory of Computation - Sipser - 1996
327	Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems - Goldreich, Micali, et al. - 1991
316	A Formal Theory of Inductive Inference - Solomonoff - 1964
284	M.: Universal one-way hash functions and their cryptographic applications - Naor, Yung - 1989
282	Robust characterizations of polynomials with applications to program testing - Rubinfeld, Sudan - 1996
268	Parallel algorithms for sharedmemory machines - Karp, Ramachandran - 1990
268	Algebraic methods for interactive proof systems - Lund, Fortnow, et al. - 1990
265	The Art of Computer Programming; vol. 2, Seminumerical Algorithms - Knuth - 1969
262	Relationships between nondeterministic and deterministic tape complexities - Savitch - 1970
262	Algebraic methods in the theory of lower bounds for Boolean circuit complexity - Smolensky - 1987
261	Digitalized signatures and public-key functions as intractable as factorization - Rabin
253	A PolynomialTime Approximation Algorithm for the Permanent of a Matrix with Nonnegative Entries - Jerrum, Sinclair, et al.
250	Random Generation of Combinatorial Structures from a Uniform Distributions, Theoret. Computer Sci - Jerrum, Valiant, et al. - 1986
250	Hardness vs. Randomness - Nisan, Wigderson - 1988
247	A parallel repetition theorem - Raz - 1998
227	Small-bias probability spaces: Efficient constructions and applications - Naor, Naor - 1993
217	Nondeterministic space is closed under complement - Immerman - 1988
216	A comparison of polynomial time reducibilities - Ladner, Lynch, et al. - 1975
213	Almost optimal lower bounds for small depth circuits - H˚astad - 1989
212	Some connections between nonuniform and uniform complexity classes - Karp, Lipton - 1980
197	Randomness is linear in space - Nisan, Zuckerman - 1996
181	Riemann’s hypothesis and tests for primality - Miller - 1976
173	Average case complete problems - Levin - 1986
163	Probabilistic algorithm for testing primality - Rabin - 1980
162	Pseudorandom generators for space-bounded computations - Nisan - 1990
158	Private coins versus public coins in interactive proof systems - Goldwasser, Sipser - 1986
142	and Avi Wigderson. Monotone circuits for connectivity require super-logarithmic depth - Karchmer - 1990
136	A complexity theoretic approach to randomness - Sipser - 1983
122	A fast Monte-Carlo test for primality - Solovay, Strassen - 1977
121	Lower bounds for the monotone complexity of some boolean functions - Razborov - 1985
121	Undirected ST-connectivity in log-space - Reingold - 2005
120	A mathematical theory of communication, Bell Sys - Shannon - 1948
112	Expander graphs and their applications - Hoory, Linial, et al.
111	Recent developments in explicit constructions of extractors,” in Current trends in theoretical computer science. The Challenge of the New Century, vol 1: Algorithms and Complexity - Shaltiel - 2004
110	Entropy waves, the zig-zag graph product, and new constant-degree expanders - REINGOLD, VADHAN, et al. - 2002