| AMS eContent Search Results |
[1] Jaikumar Radhakrishnan and Madhu Sudan.
On Dinur's proof of the PCP theorem.
Bull. Amer. Math. Soc.
44
(2007)
19-61.
MR 2265009.
Abstract, references, and article information
View Article: PDF
[2] Shlomo Hoory, Nathan Linial and Avi Wigderson.
Expander graphs and their applications.
Bull. Amer. Math. Soc.
43
(2006)
439-561.
MR 2247919.
Abstract, references, and article information
View Article: PDF
[3] A. Carbone and S. Semmes.
Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination.
Bull. Amer. Math. Soc.
34
(1997)
131-159.
MR 1423203.
Abstract, references, and article information
View Article: PDF
[4] Lenore Blum, Mike Shub and Steve Smale.
On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines.
Bull. Amer. Math. Soc.
21
(1989)
1-46.
MR 974426.
Abstract, references, and article information
View Article: PDF
|
|
Results:
1 to 4 of 4 found
Go to page:
1
|
|
|
