Advances in Computational Complexity Theory - DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By American Mathematical Society

9780821865972, 9781470439712

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Practical perfect cryptographic security

Advances in Computational Complexity Theory - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/013/08 ◽

1993 ◽

pp. 135-153

Author(s):

Ueli Maurer

Keyword(s):

Cryptographic Security

Download Full-text

Composition of the universal relation

Advances in Computational Complexity Theory - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/013/07 ◽

1993 ◽

pp. 119-134 ◽

Cited By ~ 3

Author(s):

Johan Hastad ◽

Avi Wigderson

Keyword(s):

Universal Relation

Download Full-text

Parallel matching complexity of Ramsey’s theorem

Advances in Computational Complexity Theory - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/013/03 ◽

1993 ◽

pp. 39-50 ◽

Cited By ~ 2

Author(s):

Jozsef Beck

Keyword(s):

Ramsey's Theorem ◽

Ramsey’S Theorem ◽

Parallel Matching

Download Full-text

On strong separations from 𝐴𝐶⁰

Advances in Computational Complexity Theory - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/013/02 ◽

1993 ◽

pp. 21-37 ◽

Cited By ~ 5

Author(s):

Eric Allender ◽

Vivek Gore

Download Full-text

Factoring integers and computing discrete logarithms via diophantine approximation

Advances in Computational Complexity Theory - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/013/10 ◽

1993 ◽

pp. 171-181 ◽

Cited By ~ 4

Author(s):

C Schnorr

Keyword(s):

Diophantine Approximation ◽

Discrete Logarithms

Download Full-text

A new lower bound theorem for read only once branching programs and its applications

Advances in Computational Complexity Theory - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/013/11 ◽

1993 ◽

pp. 183-193 ◽

Cited By ~ 19

Author(s):

Janos Simon ◽

Mario Szegedy

Keyword(s):

Lower Bound ◽

Branching Programs ◽

Bound Theorem

Download Full-text

Fair games against an all-powerful adversary

Advances in Computational Complexity Theory - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/013/09 ◽

1993 ◽

pp. 155-169 ◽

Cited By ~ 15

Author(s):

Rafail Ostrovsky ◽

Moti Yung ◽

Ramarathnam Venkatesan

Download Full-text

Locally random reductions in interactive complexity theory

Advances in Computational Complexity Theory - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/013/05 ◽

1993 ◽

pp. 73-98 ◽

Cited By ~ 9

Author(s):

Joan Feigenbaum

Keyword(s):

Complexity Theory

Download Full-text

On algorithms for simple stochastic games

Advances in Computational Complexity Theory - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/013/04 ◽

1993 ◽

pp. 51-71 ◽

Cited By ~ 58

Author(s):

Anne Condon

Keyword(s):

Stochastic Games

Download Full-text

Approximate counting with uniform constant depth circuits

Advances in Computational Complexity Theory - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/013/01 ◽

1993 ◽

pp. 1-20 ◽

Cited By ~ 14

Author(s):

Miklos Ajtai

Keyword(s):

Approximate Counting ◽

Constant Depth ◽

Constant Depth Circuits

Download Full-text

Advances in Computational Complexity Theory - DIMACS Series in Discrete Mathematics and Theoretical Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By American Mathematical Society

Practical perfect cryptographic security

Composition of the universal relation

Parallel matching complexity of Ramsey’s theorem

On strong separations from 𝐴𝐶⁰

Factoring integers and computing discrete logarithms via diophantine approximation

A new lower bound theorem for read only once branching programs and its applications

Fair games against an all-powerful adversary

Locally random reductions in interactive complexity theory

On algorithms for simple stochastic games

Approximate counting with uniform constant depth circuits

Advances in Computational Complexity Theory - DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Latest Publications