skip to content
The graph isomorphism problem : its structural complexity Preview this item
ClosePreview this item
Checking...

The graph isomorphism problem : its structural complexity

Author: Johannes Köbler; Uwe Schöning; Jacobo Torán
Publisher: Boston ; Berlin [u.a.] : Birkhäuser, 1993.
Series: Progress in theoretical computer science, [10].
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:

A monograph-graduate text on a topic in mathematics that is of concern to computer scientists working in the analysis of algorithms. It includes chapters on probabilistic classes, the reconstruction  Read more...

Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Johannes Köbler; Uwe Schöning; Jacobo Torán
ISBN: 0817636803 9780817636807 3764336803 9783764336806
OCLC Number: 246882287
Description: 160 S : graph. Darst.
Contents: 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.
Series Title: Progress in theoretical computer science, [10].
Responsibility: Johannes Köbler ; Uwe Schöning ; Jacobo Torán.
More information:

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/246882287>
library:oclcnum"246882287"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/246882287>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1993"
schema:exampleOfWork<http://worldcat.org/entity/work/id/866492901>
schema:inLanguage"en"
schema:name"The graph isomorphism problem : its structural complexity"
schema:publisher
schema:url
schema:workExample
schema:workExample
umbel:isLike<http://d-nb.info/931215013>

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.