|
|
|
|
| LEADER |
00000cam a2200000 a 4500 |
| 001 |
1453152 |
| 003 |
ICU |
| 005 |
19970810002600.0 |
| 008 |
930419s1993 maua b 001 0 eng |
| 010 |
|
|
|a 93022011
|
| 020 |
|
|
|a 0817636803 (acid-free)
|
| 035 |
|
|
|a (ICU)BID16989747
|
| 035 |
|
|
|a (OCoLC)27432721
|
| 040 |
|
|
|c DLC
|d DLC$dOrLoB
|
| 050 |
0 |
0 |
|a QA267.7
|b .K63 1993
|
| 082 |
|
|
|a 511/.5
|2 20
|
| 100 |
1 |
|
|a Köbler, Johannes,
|d 1958-
|0 http://id.loc.gov/authorities/names/n93010131
|1 http://viaf.org/viaf/113211022
|
| 245 |
1 |
4 |
|a The graph isomorphism problem :
|b its structural complexity /
|c Johannes Köbler, Uwe Schöning, Jacobo Torán.
|
| 260 |
|
|
|a Boston :
|b Birkhäuser,
|c c1993.
|
| 300 |
|
|
|a 160 p. :
|b ill. ;
|c 25 cm.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|0 http://id.loc.gov/vocabulary/contentTypes/txt
|
| 337 |
|
|
|a unmediated
|b n
|2 rdamedia
|0 http://id.loc.gov/vocabulary/mediaTypes/n
|
| 338 |
|
|
|a volume
|b nc
|2 rdacarrier
|0 http://id.loc.gov/vocabulary/carriers/nc
|
| 440 |
|
0 |
|a Progress in theoretical computer science
|
| 504 |
|
|
|a Includes bibliographical references (p. [149]-157) and index.
|
| 505 |
0 |
0 |
|g 1.
|t Decision Problems, Search Problems, and Counting Problems.
|g 1.1.
|t NP-Completeness.
|g 1.2.
|t Reducing the Construction Problem to the Decision Problem.
|g 1.3.
|t Counting versus Deciding for Graph Isomorphism.
|g 1.4.
|t Uniqueness of the Solution.
|g 1.5.
|t Reducing Multiple Questions to One --
|g 2.
|t Quantifiers, Games, and Interactive Proofs.
|g 2.1.
|t The Polynomial-Time Hierarchy.
|g 2.2.
|t Interactive Proof Systems.
|g 2.3.
|t Probabilistic Classes.
|g 2.4.
|t Lowness and Collapses --
|g 3.
|t Circuits and Sparse Sets.
|g 3.1.
|t Polynomial Size Circuits.
|g 3.2.
|t Reductions to Sparse Sets --
|g 4.
|t Counting Properties.
|g 4.1.
|t Decision Reduces to Parity.
|g 4.2.
|t Graph Isomorphism is Low for PP.
|g 4.3.
|t The Reconstruction Conjecture.
|
| 650 |
|
0 |
|a Computational complexity
|0 http://id.loc.gov/authorities/subjects/sh85029473
|
| 650 |
|
0 |
|a Graph theory
|x Data processing
|0 http://id.loc.gov/authorities/subjects/sh85056472
|
| 650 |
|
0 |
|a Isomorphisms (Mathematics)
|0 http://id.loc.gov/authorities/subjects/sh85068654
|
| 650 |
|
7 |
|a Computational complexity.
|2 fast
|0 http://id.worldcat.org/fast/fst00871991
|
| 650 |
|
7 |
|a Graph theory
|x Data processing.
|2 fast
|0 http://id.worldcat.org/fast/fst00946587
|
| 650 |
|
7 |
|a Isomorphisms (Mathematics)
|2 fast
|0 http://id.worldcat.org/fast/fst00980192
|
| 700 |
1 |
0 |
|a Schöning, Uwe,
|d 1955-
|0 http://id.loc.gov/authorities/names/n85187110
|1 http://viaf.org/viaf/108228765
|
| 700 |
1 |
0 |
|a Torán, Jacobo,
|d 1962-
|0 http://id.loc.gov/authorities/names/n93010136
|1 http://viaf.org/viaf/49317675
|
| 850 |
|
|
|a ICU
|
| 901 |
|
|
|a ToCBNA
|
| 903 |
|
|
|a HeVa
|
| 929 |
|
|
|a cat
|
| 999 |
f |
f |
|i 5d4ad0e8-787e-577e-963f-d387f5202164
|s 7304fb8f-7c18-594a-815b-41b060c7dc48
|
| 928 |
|
|
|t Library of Congress classification
|a QA267.7.K630 1993
|l Eck
|c Eck-Eck
|i 2387490
|
| 927 |
|
|
|t Library of Congress classification
|a QA267.7.K630 1993
|l Eck
|c Eck-Eck
|b 37515974
|i 2830639
|
