Advances in computational complexity theory
Author(s)
Bibliographic Information
Advances in computational complexity theory
（DIMACS series in discrete mathematics and theoretical computer science, v. 13）
American Mathematical Society, c1993
Available at / 19 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references
Description and Table of Contents
Description
This collection of recent papers on computational complexity theory grew out of activities during a special year at DIMACS. With contributions by some of the leading experts in the field, this book is of lasting value in this fast-moving field, providing expositions not found elsewhere. Although aimed primarily at researchers in complexity theory and graduate students in mathematics or computer science, the book is accessible to anyone with an undergraduate education in mathematics or computer science. By touching on some of the major topics in complexity theory, this book sheds light on this burgeoning area of research.
Table of Contents
Approximate counting with uniform constant-depth circuits by M. Ajtai On strong separations from $AC^0$ by E. Allender and V. Gore Parallel matching complexity of Ramsey's theorem by J. Beck On algorithms for simple stochastic games by A. Condon Locally random reductions in interactive complexity theory by J. Feigenbaum An application of game-theoretic techniques to cryptography by M. J. Fischer and R. N. Wright Composition of the universal relation by J. Ha stad and A. Wigderson Practical perfect cryptographic security by U. M. Maurer Fair games against an all-powerful adversary by R. Ostrovsky, R. Venkatesan, and M. Yung Factoring integers and computing discrete logarithms via diophantine approximation by C. P. Schnorr A new lower bound theorem for read-only-once branching programs and its applications by J. Simon and M. Szegedy On the E -isomorphism problem by J. Wang.
by "Nielsen BookData"