| AMS eContent Search Results |
[1] E. A. Hirsch and D. M. Itsykson.
An infinitely-often one-way function based on an average-case assumption.
St. Petersburg Math. J.
21
(2010)
459-468.
MR 2588765.
Abstract, references, and article information
View Article: PDF
[2] 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
[3] 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
[4] Kai-Tai Fang, Dietmar Maringer, Yu Tang and Peter Winker.
Lower bounds and stochastic optimization algorithms for uniform designs with three or four levels.
Math. Comp.
75
(2006)
859-878.
MR 2196996.
Abstract, references, and article information
View Article: PDF
[5] Kai-Tai Fang and Gennian Ge.
A sensitive algorithm for detecting the inequivalence of Hadamard matrices.
Math. Comp.
73
(2004)
843-851.
MR 2031409.
Abstract, references, and article information
View Article: PDF
This article is available free of charge
[6] 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
[7] Carlos Gustavo T. de A. Moreira.
On asymptotic estimates for arithmetic cost functions.
Proc. Amer. Math. Soc.
125
(1997)
347-353.
MR 1350946.
Abstract, references, and article information
View Article: PDF
This article is available free of charge
[8] Tomás Feder.
Stable networks and product graphs.
Mem. Amer. Math. Soc.
116
(1995)
MR 1271694.
Book volume table of contents
[9] Jan Krajíček.
Fragments of bounded arithmetic and bounded query
classes
.
Trans. Amer. Math. Soc.
338
(1993)
587-598.
MR 1124169.
Abstract, references, and article information
View Article: PDF
This article is available free of charge
[10] Richard Mansfield.
The irrationals are not recursively enumerable
.
Proc. Amer. Math. Soc.
110
(1990)
495-497.
MR 1019752.
Abstract, references, and article information
View Article: PDF
This article is available free of charge
[11] 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
[12] Arthur G. Werschulz.
What is the complexity of related elliptic,
parabolic, and hyperbolic problems?
.
Math. Comp.
47
(1986)
461-472.
MR 856697.
Abstract, references, and article information
View Article: PDF
[13] Douglas N. Hoover.
Probabilities on models of universal sentences
.
Proc. Amer. Math. Soc.
98
(1986)
294-297.
MR 854036.
Abstract, references, and article information
View Article: PDF
This article is available free of charge
[14] Wolfgang Maass.
Combinatorial lower bound arguments for
deterministic and nondeterministic Turing machines
.
Trans. Amer. Math. Soc.
292
(1985)
675-693.
MR 808746.
Abstract, references, and article information
View Article: PDF
This article is available free of charge
[15] Bruno Scarpellini.
Complexity of subcases of Presburger arithmetic
.
Trans. Amer. Math. Soc.
284
(1984)
203-218.
MR 742421.
Abstract, references, and article information
View Article: PDF
This article is available free of charge
|
|
Results:
1 to 15 of 15 found
Go to page:
1
|
|
|
