More than 1,900 Springer Protocols eBooks at just $9.99 each! Get yours today>>

Progress in Theoretical Computer Science

The Graph Isomorphism Problem

Its Structural Complexity

Authors: Kobler, J., Schöning, U., Toran, Jacobo

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-1-4612-0333-9
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $169.00
price for USA
  • ISBN 978-0-8176-3680-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $139.00
price for USA
  • ISBN 978-1-4612-6712-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
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.

Table of contents (6 chapters)

  • Introduction

    Köbler, Johannes (et al.)

    Pages 1-4

  • Preliminaries

    Köbler, Johannes (et al.)

    Pages 5-10

  • Decision Problems, Search Problems, and Counting Problems

    Köbler, Johannes (et al.)

    Pages 11-50

  • Quantifiers, Games, and Interactive Proofs

    Köbler, Johannes (et al.)

    Pages 51-90

  • Circuits and Sparse Sets

    Köbler, Johannes (et al.)

    Pages 91-116

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-1-4612-0333-9
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $169.00
price for USA
  • ISBN 978-0-8176-3680-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $139.00
price for USA
  • ISBN 978-1-4612-6712-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
The Graph Isomorphism Problem
Book Subtitle
Its Structural Complexity
Authors
Series Title
Progress in Theoretical Computer Science
Copyright
1993
Publisher
Birkhäuser Basel
Copyright Holder
Springer Science+Business Media New York
eBook ISBN
978-1-4612-0333-9
DOI
10.1007/978-1-4612-0333-9
Hardcover ISBN
978-0-8176-3680-7
Softcover ISBN
978-1-4612-6712-6
Edition Number
1
Number of Pages
VII, 160
Topics