E. Szemeredi

Submitted by smcneil on Thu, 2013-03-21 13:23
Home Page: 
http://www.renyi.hu/~szemered/

E. Szemeredi

Submitted by smcneil on Thu, 2013-03-21 13:22
Home Page: 
http://www.renyi.hu/~szemered/

D. Lichtenstein

Submitted by smcneil on Thu, 2013-03-21 13:18

Computational Pseudo-Randomness

Submitted by smcneil on Wed, 2013-03-13 11:24
Author: 
A. Wigderson
Publication: 
Israel Symposium on Theory of Computing and Systems (ISTCS), pp. 218-219, 1995.
Year: 
1995
Files
File: 
Journal Version (pdf)

Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity

Submitted by smcneil on Wed, 2013-03-13 10:52
Author: 
M. Karchmer
R. Raz
A. Wigderson
Publication: 
Computational Complexity, vol. 5, no. 3-4, pp. 191-204, 1995.
Year: 
1995
Files
File: 
Journal Version (pdf)

The Future of Computational Complexity Theory: Part I

Submitted by smcneil on Tue, 2013-03-12 15:13
Author: 
C. Papadimitriou
O. Goldreich
A. Wigderson
A. Razborov
M. Sipser
Publication: 
SIGACT News, vol. 27, no. 3, pp. 6-12, 1996.
Year: 
1996
Abstract: 
Journal Version (pdf)

M. Sipser

Submitted by smcneil on Tue, 2013-03-12 15:10
Home Page: 
http://www-math.mit.edu/~sipser/

C. Papadimitriou

Submitted by smcneil on Tue, 2013-03-12 15:09
Home Page: 
http://www.cs.berkeley.edu/~christos/

Theory of Computing: A Scientific Perspective

Submitted by smcneil on Tue, 2013-03-12 14:44
Author: 
O. Goldreich
A. Wigderson
Publication: 
SIGACT News, vol 28, no. 3, pp 100-102, 1997.
Year: 
1997
Files
File: 
Journal Version (pdf)

Do probabilistic algorithms outperform deterministic ones?

Submitted by smcneil on Tue, 2013-03-12 14:30
Author: 
A. Wigderson
Publication: 
International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 1443, pp. 212-214, 1998.
Year: 
1998
Files
File: 
Proceedings Version (pdf)

Pages

Subscribe to Avi Wigderson RSS