Advances In Computational Complexity Theory, Proceedings of a DIMACS Workshop, New Jersey, USA, December 3-7, 1990 - researchr publication

researchr

You are not signed in
Sign in
Sign up

Jin-yi Cai, editor, Advances In Computational Complexity Theory, Proceedings of a DIMACS Workshop, New Jersey, USA, December 3-7, 1990. Volume 13 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, DIMACS/AMS, 1993. [doi]

Conference: dimacs1993

Abstract is missing.

Approximate Counting with Uniform Constant-Depth CircuitsMiklós Ajtai. 1-20

On Strong Separations from ACEric Allender, Vivek Gore. 21-38

Parallel Matching Complexity of Ramsey's TheoremJózsef Beck. 39-50

On Algorithms for Simple Stochastic GamesAnne Condon. 51-72

Locally Random Reductions in Interactive Complexity TheoryJoan Feigenbaum. 73-98

An Application of Game-Theoretic Techniques to CryptographyMichael J. Fischer, Rebecca N. Wright. 99-118

Composition of the Universal RelationJohan Håstad, Avi Wigderson. 119-134

Practical Perfect Cryptographic SecurityUeli M. Maurer. 135-154

Fair Games against an All-Powerful AdversaryRafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung. 155-170

Factoring Integers and Computing Discrete Logarithms via Diophantine ApproximationClaus-Peter Schnorr. 171-182

A New Lower Bound Theorem for Read-Only-Once Branching Programs and its ApplicationsJanos Simon, Mario Szegedy. 183-194

On the E-Isomorphism ProblemJie Wang 0002. 195

runs on WebDSL