Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
The Graph Isomorphism Problem: Its Structural Complexity

The Graph Isomorphism Problem: Its Structural Complexity

Toran, J.
Kobler, J.
Schöning, U.

Hardcover

Series: Progress in Theoretical Computer Science

General ComputersGeneral Mathematics

ISBN10: 0817636803
ISBN13: 9780817636807
Publisher: Springer Nature
Published: Jul 1 1993
Pages: 160
Weight: 0.92
Height: 0.44 Width: 6.14 Depth: 9.21
Language: English
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.

1 different editions

Also available

Also in

General Computers

View All