The Graph Isomorphism Problem

The Graph Isomorphism Problem
Author :
Publisher : Springer Science & Business Media
Total Pages : 168
Release :
ISBN-10 : 9781461203339
ISBN-13 : 1461203333
Rating : 4/5 (39 Downloads)

Book Synopsis The Graph Isomorphism Problem by : J. Kobler

Download or read book The Graph Isomorphism Problem written by J. Kobler and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 168 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.


The Graph Isomorphism Problem Related Books

The Graph Isomorphism Problem
Language: en
Pages: 168
Authors: J. Kobler
Categories: Computers
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

Recently, a variety ofresults on the complexitystatusofthegraph isomorphism problem has been obtained. These results belong to the so-called structural part of
Complexity Issues in VLSI
Language: en
Pages: 168
Authors: Frank Thomson Leighton
Categories: Electronic Circuit Design
Type: BOOK - Published: 1983 - Publisher: MIT Press (MA)

DOWNLOAD EBOOK

This book solves several mathematical problems in the areas of Very Large Scale Integration (VLSI) and parallel computation. In particular, it describes optimal
Complexity Classifications of Boolean Constraint Satisfaction Problems
Language: en
Pages: 112
Authors: Nadia Creignou
Categories: Mathematics
Type: BOOK - Published: 2001-01-01 - Publisher: SIAM

DOWNLOAD EBOOK

Presents a novel form of a compendium that classifies an infinite number of problems by using a rule-based approach.
The Steiner Tree Problem
Language: en
Pages: 251
Authors: Hans Jürgen Prömel
Categories: Mathematics
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

In recent years, algorithmic graph theory has become increasingly important as a link between discrete mathematics and theoretical computer science. This textbo
Algorithms and Complexity
Language: en
Pages: 219
Authors: Herbert S. Wilf
Categories:
Type: BOOK - Published: 2020-09-30 - Publisher: A K PETERS

DOWNLOAD EBOOK

This book is an introductory textbook on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for