The Graph Isomorphism Problem Its Structural Complexity / by J. Kobler, U. Schöning, J. Toran.

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,...

Full description

Saved in:
Bibliographic Details
Main Authors: Kobler, J. (Author), Schöning, U. (Author), Toran, J. (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Boston, MA : Birkhäuser Boston : Imprint: Birkhäuser, 1993.
Edition:1st ed. 1993.
Series:Progress in Theoretical Computer Science
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3237172
003 MWH
005 20191026212615.0
007 cr nn 008mamaa
008 121227s1993 xxu| s |||| 0|eng d
020 |a 9781461203339 
024 7 |a 10.1007/978-1-4612-0333-9  |2 doi 
035 |a (DE-He213)978-1-4612-0333-9 
050 4 |a E-Book 
072 7 |a UYAM  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
072 7 |a UYAM  |2 thema 
072 7 |a UFM  |2 thema 
100 1 |a Kobler, J.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 4 |a The Graph Isomorphism Problem  |h [electronic resource] :  |b Its Structural Complexity /  |c by J. Kobler, U. Schöning, J. Toran. 
250 |a 1st ed. 1993. 
264 1 |a Boston, MA :  |b Birkhäuser Boston :  |b Imprint: Birkhäuser,  |c 1993. 
300 |a VII, 160 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Progress in Theoretical Computer Science 
490 1 |a Springer eBook Collection 
505 0 |a 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. 
520 |a 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. 
590 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Computer science—Mathematics. 
650 0 |a Applied mathematics. 
650 0 |a Engineering mathematics. 
650 0 |a Combinatorics. 
650 0 |a Algorithms. 
650 0 |a Computer mathematics. 
690 |a Electronic resources (E-books) 
700 1 |a Schöning, U.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
700 1 |a Toran, J.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Progress in Theoretical Computer Science 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-1-4612-0333-9  |3 Click to view e-book  |t 0 
907 |a .b3237172x  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g xxu  |h 4  |i 1 
912 |a ZDB-2-SCS 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i21503370  |z 02-26-20 
999 f f |i b466cec5-cb5f-58d0-a33c-cedb0a66b267  |s 7edb2c75-9c3d-59ba-a912-98411e23eac6  |t 0 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |t 0  |e E-Book  |h Library of Congress classification  |i Elec File