Cover

Title page

Contents

Foreword

Preface

Approximate counting with uniform constant depth circuits

On strong separations from 𝐴𝐶⁰

Parallel matching complexity of Ramsey’s theorem

On algorithms for simple stochastic games

Locally random reductions in interactive complexity theory

An application of game theoretic techniques to cryptography

Composition of the universal relation

Practical perfect cryptographic security

Fair games against an all-powerful adversary

Factoring integers and computing discrete logarithms via diophantine approximation

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

On the E-isomorphism problem

Back Cover