Recently, a variety ofresults on the complexitystatusofthegraph isomorphism problem has been obtained. These results belong to the so-called structural part of Complexity Theory. Our idea behind this book is to summarize such results which might otherwise not be easily accessible in the literature, and also, to give the reader an understanding of the aims and topics in Structural Complexity Theory, in general. The text is basically self contained; the only prerequisite for reading it is some elementary knowledge from Complexity Theory and Probability Theory. It can be used to teach a seminar or a monographic graduate course, but also parts of it (especially Chapter 1) provide a source of examples for a standard graduate course on Complexity Theory. Many people have helped us in different ways III the process of writing this book. Especially, we would like to thank V. Arvind, R.V. Book, E. May� ordomo, and the referee who gave very constructive comments. This book project was especially made possible by a DAAD grant in the "Acciones In� tegrada" program. The third author has been supported by the ESPRIT project ALCOM-II.

Contenuti

Preliminaries.- 1 Decision Problems, Search Problems, and Counting Problems.- 1.1 NP-Completeness.- 1.1.1 The Classes P and NP.- 1.1.2 Reducibility.- 1.2 Reducing the Construction Problem to the Decision Problem.- 1.3 Counting versus Deciding for Graph Isomorphism.- 1.4 Uniqueness of the Solution.- 1.4.1 Random Reductions.- 1.4.2 Promise Problems.- 1.5 Reducing Multiple Questions to One.- 2 Quantifiers, Games, and Interactive Proofs.- 2.1 The Polynomial-Time Hierarchy.- 2.2 Interactive Proof Systems.- 2.2.1 The Class IP.- 2.2.2 Zero-Knowledge.- 2.3 Probabilistic Classes.- 2.3.1 Probability Amplification.- 2.3.2 The BP-Operator.- 2.3.3 Arthur-Merlin Games.- 2.4 Lowness and Collapses.- 3 Circuits and Sparse Sets.- 3.1 Polynomial Size Circuits.- 3.1.1 Circuits for NP.- 3.1.2 Circuits for Graph Isomorphism.- 3.2 Reductions to Sparse Sets.- 4 Counting Properties.- 4.1 Decision Reduces to Parity.- 4.2 Graph Isomorphism is Low for PP.- 4.3 The Reconstruction Conjecture.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Descrizione libreria

Kennys.ie is the largest exporter of books from Ireland currently exporting to approximately 100 countries around the world. Kennys Bookshop houses hundreds of thousands of books and specialises in collection development and library services, supplying booksellers and state and university libraries on a global scale including the U.S.A.,Japan and Europe. Kennys.ie is Ireland's Largest Online Bookshop.

Visita la pagina della libreria

Informazioni sull?azienda del venditore

Kennys Bookshop and Art Galleries Ltd.
Liosban Industrial Estate, Tuam Road, Galway, Ireland

Condizioni di vendita e spedizione

Condizioni di vendita

Terms of Sale - Credit Cards: Visa, Master Card, American Express, Diner.
Payment can also be made by bank draft in Euros, drawn on an Irish Bank.

We regret that PO Boxes are not acceptable to the U.S. as our courier will not deliver to them.

In case of returns or queries please contact us by email books@kennys.ie or by phone +353 91 709350

VAT Registration - IE2238521A

Conor Kenny

Diritto di recesso

Condizioni di spedizione

Free Shipping

Tariffe di spedizione da Irlanda a U.S.A.

Tariffe di spedizione da Irlanda a U.S.A.
Quantit� dell?ordine	Da 12 a 22 giorni lavorativi	Da 10 a 20 giorni lavorativi
Primo articolo	EUR 10.50	EUR 11.50

I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.