Zur Startseite gehen
0,00 €*
Cover: 9780817636807 | The Graph Isomorphism Problem | Its Structural Complexity | Buch | VII
Dekorationsartikel gehören nicht zum Leistungsumfang.
The Graph Isomorphism Problem
Its Structural Complexity
Buch von J. Kobler (u. a.)
Sprache: Englisch

100,95 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 2-3 Wochen

Kategorien:
Beschreibung
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.
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.
Inhaltsverzeichnis
Preliminaries.- 1 Decision Problems, Search Problems, and Counting Problems.- 1.1 NP-Completeness.- 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.5 Reducing Multiple Questions to One.- 2 Quantifiers, Games, and Interactive Proofs.- 2.1 The Polynomial-Time Hierarchy.- 2.2 Interactive Proof Systems.- 2.3 Probabilistic Classes.- 2.4 Lowness and Collapses.- 3 Circuits and Sparse Sets.- 3.1 Polynomial Size Circuits.- 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.
Details
Erscheinungsjahr: 1993
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Seiten: 172
Reihe: Progress in Theoretical Computer Science
Inhalt: vii
160 S.
ISBN-13: 9780817636807
ISBN-10: 0817636803
Sprache: Englisch
Ausstattung / Beilage: HC runder Rücken kaschiert
Einband: Gebunden
Autor: Kobler, J.
Toran, J.
Schöning, U.
Auflage: 1993
Hersteller: Birkh„user Boston
Birkhäuser Boston
Progress in Theoretical Computer Science
Maße: 241 x 160 x 15 mm
Von/Mit: J. Kobler (u. a.)
Erscheinungsdatum: 01.07.1993
Gewicht: 0,43 kg
preigu-id: 102381423
Inhaltsverzeichnis
Preliminaries.- 1 Decision Problems, Search Problems, and Counting Problems.- 1.1 NP-Completeness.- 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.5 Reducing Multiple Questions to One.- 2 Quantifiers, Games, and Interactive Proofs.- 2.1 The Polynomial-Time Hierarchy.- 2.2 Interactive Proof Systems.- 2.3 Probabilistic Classes.- 2.4 Lowness and Collapses.- 3 Circuits and Sparse Sets.- 3.1 Polynomial Size Circuits.- 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.
Details
Erscheinungsjahr: 1993
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Seiten: 172
Reihe: Progress in Theoretical Computer Science
Inhalt: vii
160 S.
ISBN-13: 9780817636807
ISBN-10: 0817636803
Sprache: Englisch
Ausstattung / Beilage: HC runder Rücken kaschiert
Einband: Gebunden
Autor: Kobler, J.
Toran, J.
Schöning, U.
Auflage: 1993
Hersteller: Birkh„user Boston
Birkhäuser Boston
Progress in Theoretical Computer Science
Maße: 241 x 160 x 15 mm
Von/Mit: J. Kobler (u. a.)
Erscheinungsdatum: 01.07.1993
Gewicht: 0,43 kg
preigu-id: 102381423
Warnhinweis

Ähnliche Produkte

Diese Website verwendet Cookies, um eine bestmögliche Erfahrung bieten zu können. Mehr Informationen ...