Advances In Computational Complexity Theory

Keyphrases

Publications

volume 13, 1993

Advances In Computational Complexity Theory, Proceedings of a DIMACS Workshop, New Jersey, USA, December 3-7, 1990 Advances In Computational Complexity Theory 13 (1993)

1990

Forward. Advances In Computational Complexity Theory (1990)
Ueli M. Maurer
Practical Perfect Cryptographic Security. Advances In Computational Complexity Theory (1990)
Janos Simon, Mario Szegedy
A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications. Advances In Computational Complexity Theory (1990)
Eric Allender, Vivek Gore
On Strong Separations from AC. Advances In Computational Complexity Theory (1990)
Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung
Fair Games against an All-Powerful Adversary. Advances In Computational Complexity Theory (1990)
Miklós Ajtai
Approximate Counting with Uniform Constant-Depth Circuits. Advances In Computational Complexity Theory (1990)
Johan Håstad, Avi Wigderson
Composition of the Universal Relation. Advances In Computational Complexity Theory (1990)
József Beck
Parallel Matching Complexity of Ramsey's Theorem. Advances In Computational Complexity Theory (1990)
Michael J. Fischer, Rebecca N. Wright
An Application of Game-Theoretic Techniques to Cryptography. Advances In Computational Complexity Theory (1990)
Claus-Peter Schnorr
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation. Advances In Computational Complexity Theory (1990)
Preface. Advances In Computational Complexity Theory (1990)
Jie Wang
On the E-Isomorphism Problem. Advances In Computational Complexity Theory (1990)
Anne Condon
On Algorithms for Simple Stochastic Games. Advances In Computational Complexity Theory (1990)
Joan Feigenbaum
Locally Random Reductions in Interactive Complexity Theory. Advances In Computational Complexity Theory (1990)