default search action
DIMACS Workshop: Advances In Computational Complexity Theory 1990
- Jin-Yi Cai:
Advances In Computational Complexity Theory, Proceedings of a DIMACS Workshop, New Jersey, USA, December 3-7, 1990. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 13, DIMACS/AMS 1993, ISBN 978-0-8218-6597-2 - Forward. Advances In Computational Complexity Theory 1990: ix-
- Preface. Advances In Computational Complexity Theory 1990: xi-
- Miklós Ajtai:
Approximate Counting with Uniform Constant-Depth Circuits. 1-20 - Eric Allender, Vivek Gore:
On Strong Separations from AC. 21-37 - József Beck:
Parallel Matching Complexity of Ramsey's Theorem. 39-50 - Anne Condon:
On Algorithms for Simple Stochastic Games. 51-71 - Joan Feigenbaum:
Locally Random Reductions in Interactive Complexity Theory. 73-98 - Michael J. Fischer, Rebecca N. Wright:
An Application of Game-Theoretic Techniques to Cryptography. 99-118 - Johan Håstad, Avi Wigderson:
Composition of the Universal Relation. 119-134 - Ueli M. Maurer:
Practical Perfect Cryptographic Security. 135-153 - Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung:
Fair Games against an All-Powerful Adversary. 155-169 - Claus-Peter Schnorr:
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation. 171-181 - Janos Simon, Mario Szegedy:
A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications. 183-193 - Jie Wang:
On the E-Isomorphism Problem. 195-209
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.