Skip to main content
SpringerLink
Log in
Birkhäuser
Book cover

The Graph Isomorphism Problem

Its Structural Complexity

  • Book
  • © 1993

Overview

Authors:
  1. Johannes Köbler

    1. Abteilung Theoretische Informatik, Universität Ulm, Ulm, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Uwe Schöning

    1. Fakultät für Informatik, Universität Ulm, Ulm, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

  3. Jacobo Torán

    1. Dept. de Leng. i. Sist. Informatics, Universitat Politécnica de Catalunya, Barcelona, Spain

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Progress in Theoretical Computer Science (PTCS)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (6 chapters)

  1. Front Matter

    Pages i-vii
    Download chapter PDF

  2. Introduction

    • Johannes Köbler, Uwe Schöning, Jacobo Torán
    Pages 1-4

  3. Preliminaries

    • Johannes Köbler, Uwe Schöning, Jacobo Torán
    Pages 5-10

  4. Decision Problems, Search Problems, and Counting Problems

    • Johannes Köbler, Uwe Schöning, Jacobo Torán
    Pages 11-50

  5. Quantifiers, Games, and Interactive Proofs

    • Johannes Köbler, Uwe Schöning, Jacobo Torán
    Pages 51-90

  6. Circuits and Sparse Sets

    • Johannes Köbler, Uwe Schöning, Jacobo Torán
    Pages 91-116

  7. Counting Properties

    • Johannes Köbler, Uwe Schöning, Jacobo Torán
    Pages 117-148

  8. Back Matter

    Pages 149-160
    Download chapter PDF
Back to top

Keywords

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.

Authors and Affiliations

  • Abteilung Theoretische Informatik, Universität Ulm, Ulm, Germany

    Johannes Köbler

  • Fakultät für Informatik, Universität Ulm, Ulm, Germany

    Uwe Schöning

  • Dept. de Leng. i. Sist. Informatics, Universitat Politécnica de Catalunya, Barcelona, Spain

    Jacobo Torán

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation