Automata, Computability, and Complexity 1/Complexity theory 2/Computability theory
2/Automata theory 3/Mathematical Notions and Terminology 3/Sets 3/Sequences and tuples …

Emphasizing issues of computational efficiency, Michael Kearns and Umesh Vazirani
introduce a number of central topics in computational learning theory for researchers and …

This book is an introduction to a new rapidly developing topic: the theory of quantum
computing. It begins with the basics of classical theory of computation: Turing machines …

In this paper, we prove the intractability of learning several classes of Boolean functions in
the distribution-free model (also called the Probably Approximately Correct or PAC model) of …

A basic issue in computer science is the complexity of problems. Computational complexity
measures how much time or memory is needed as a function of the input problem size …

We show that any language recognized by an NC 1 circuit (fan-in 2, depth O (logn)) can be
recognized by a particular type of width 5 polynomial-size branching program. As any …

We describe efficient constructions for various cryptographic primitives in private-key as well
as public-key cryptography. Our main results are two new constructions of pseudo-random …

Page 1 Heribert Vollmer Introduction to Circuit Complexity $ Springer Page 2 Page 3 Texts in
Theoretical Computer Science An EATCS Series Editors: W. Brauer G. Rozenberg A. Salomaa …

This book is devoted to the computation of the elementary functions. Here, we call
elementary functions the most commonly used mathematical functions: sin, cos, tan, sin− 1 …

In order to study circuit complexity classes within NC 1 in a uniform setting, we need a
uniformity condition which is more restrictive than those in common use. Two such …