Complexity of Computational and Proofs

Area 01 – Scienze matematiche e informatiche

The present volume offers ten papers in computational complexity theory, a mathematical theory motivated by fundamental theoretical problems of computer science. Some of the papers are full-fledged expository articles, some concentrate on a particular well delineated topic or problem through which they expose deeper issues and ideas. Different papers in the volume need different levels of prerequisites, sophistication and concentration from a reader. But they all, I believe, reward the reader willing to spend the effort with insights into contemporary complexity theory. All papers have been refereed.

SINTESI

INDICE