nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Lower Bound for Primality
|
Allender, Eric |
|
2001 |
62 |
2 |
p. 356-366 11 p. |
artikel |
2 |
Computational Arithmetic Geometry
|
Rojas, J.Maurice |
|
2001 |
62 |
2 |
p. 216-235 20 p. |
artikel |
3 |
Graph Ramsey Theory and the Polynomial Hierarchy
|
Schaefer, Marcus |
|
2001 |
62 |
2 |
p. 290-322 33 p. |
artikel |
4 |
GUEST EDITOR'S FOREWORD
|
Fortnow, Lance |
|
2001 |
62 |
2 |
p. 215- 1 p. |
artikel |
5 |
Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes
|
Buss, Sam |
|
2001 |
62 |
2 |
p. 267-289 23 p. |
artikel |
6 |
On the Complexity of k-SAT
|
Impagliazzo, Russell |
|
2001 |
62 |
2 |
p. 367-375 9 p. |
artikel |
7 |
Papers to Appear in Forthcoming Issues
|
|
|
2001 |
62 |
2 |
p. 392- 1 p. |
artikel |
8 |
Pseudorandom Generators without the XOR Lemma
|
Sudan, Madhu |
|
2001 |
62 |
2 |
p. 236-266 31 p. |
artikel |
9 |
Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity
|
Watrous, John |
|
2001 |
62 |
2 |
p. 376-391 16 p. |
artikel |
10 |
The Communication Complexity of Pointer Chasing
|
Ponzio, Stephen J. |
|
2001 |
62 |
2 |
p. 323-355 33 p. |
artikel |