Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Similar content being viewed by others
Table of contents (6 chapters)
Authors and Affiliations
Accessibility Information
PDF accessibility summary
This PDF is not accessible. It is based on scanned pages and does not support features such as screen reader compatibility or described non-text content (images, graphs etc). However, it likely supports searchable and selectable text based on OCR (Optical Character Recognition). Users with accessibility needs may not be able to use this content effectively. Please contact us at accessibilitysupport@springernature.com if you require assistance or an alternative format.
Bibliographic Information
Book Title: The Graph Isomorphism Problem
Book Subtitle: Its Structural Complexity
Authors: Johannes Köbler, Uwe Schöning, Jacobo Torán
Series Title: Progress in Theoretical Computer Science
DOI: https://doi.org/10.1007/978-1-4612-0333-9
Publisher: Birkhäuser Boston, MA
-
eBook Packages: Springer Book Archive
Copyright Information: Springer Science+Business Media New York 1993
Hardcover ISBN: 978-0-8176-3680-7Published: 01 July 1993
Softcover ISBN: 978-1-4612-6712-6Published: 09 October 2012
eBook ISBN: 978-1-4612-0333-9Published: 06 December 2012
Edition Number: 1
Number of Pages: VII, 160
Topics: Math Applications in Computer Science, Applications of Mathematics, Combinatorics, Algorithm Analysis and Problem Complexity, Computational Mathematics and Numerical Analysis