Bell's 1964 theorem, which states that the predictions of quantum theory cannot be
accounted for by any local theory, represents one of the most profound developments in the …

This book is rooted in the thesis that complexity theory is extremely rich in conceptual
content, and that this contents should be explicitly communicated in expositions and courses …

In this work, we focus on the challenge of taking partial observations of highly-stylized text
and generalizing the observations to generate unobserved glyphs in the ornamented …

Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

We initiate the study of a proof system model that naturally combines interactive proofs (IPs)
and probabilistically-checkable proofs (PCPs), and generalizes interactive PCPs (which …

We propose an analytical framework for studying parallel repetition, a basic product
operation for one-round twoplayer games. In this framework, we consider a relaxation of the …

Quantum cryptography promises levels of security that are impossible to attain in a classical
world. Can this security be guaranteed to classical users of a quantum protocol, who may …

This beginning graduate textbook describes both recent achievements and classical results
of computational complexity theory. Requiring essentially no background apart from …

Given a collection ℱ of subsets of S={1,…, n}, set cover is the problem of selecting as few as
possible subsets from ℱ such that their union covers S,, and max k-cover is the problem of …

Discrete optimization problems are everywhere, from traditional operations research
planning (scheduling, facility location and network design); to computer science databases; …