| Approximate counting with uniform constant-depth circuits / M. Ajtai |
| On strong separations from $AC^0$ / E. Allender ; V. Gore |
| Parallel matching complexity of Ramsey's theorem / J. Beck |
| On algorithms for simple stochastic games / A. Condon |
| Locally random reductions in interactive complexity theory / J. Feigenbaum |
| An application of game-theoretic techniques to cryptography / M. J. Fischer ; R. N. Wright |
| Composition of the universal relation / J. Ha stad ; A. Wigderson |
| Practical perfect cryptographic security / U. M. Maurer |
| Fair games against an all-powerful adversary / R. Ostrovsky ; R. Venkatesan ; M. Yung |
| Factoring integers and computing discrete logarithms via diophantine approximation / C. P. Schnorr |
| A new lower bound theorem for read-only-once branching programs and its applications / J. Simon ; M. Szegedy |
| On the E -isomorphism problem / J. Wang |
| Approximate counting with uniform constant-depth circuits / M. Ajtai |
| On strong separations from $AC^0$ / E. Allender ; V. Gore |
| Parallel matching complexity of Ramsey's theorem / J. Beck |
図書
