Various types of probabilistic proof systems have played a central role in the development of com...

A conceptual introduction to modern topics in complexity for advanced undergraduate and graduate ...

Cryptography is concerned with the conceptualization, definition and construction of computing sy...

An interactive proof system is called doubly-efficient if the prescribed prover strategy can be i...

The focus of this book is the P versus NP Question and the theory of NP-completeness. It also pro...

This volume contains a collection of studies in the areas of complexity theory and property testi...

Cryptography is concerned with the conceptualization, definition and construction of computing sy...

You can start by putting the DO NOT DISTURB sign. Cay, in Desert Hearts (1985). The interplay bet...

This book presents a collection of 36 pieces of scientific work in the areas of complexity theory...

Cryptography is concerned with the construction of schemes that withstand any abuse.A cryptograph...

You can start by putting the DO NOT DISTURB sign. Cay, in Desert Hearts (1985). The interplay bet...

Starting from the basics of computability, this undergraduate introduction focuses on the P versu...

This volume contains a collection of studies in the areas of complexity theory and local algorith...

Property testing is concerned with the design of super-fast algorithms for the structural analysi...

Cryptography is concerned with the construction of schemes that withstand any abuse.A cryptograph...

Property Testing is the study of super-fast (randomized) algorithms for approximate decision maki...

On May 1, 2004, the world of theoretical computer science su?ered a stunning loss: Shimon Even pa...