The Graph Isomorphism Problem Its Structural Complexity

The Graph Isomorphism Problem Its Structural Complexity / by J. Kobler, U. Schöning, J. Toran.

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,...

Full description

Saved in:
Bibliographic Details
Main Authors: Kobler, J. (Author), Schöning, U. (Author), Toran, J. (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Boston, MA : Birkhäuser Boston : Imprint: Birkhäuser, 1993.
Edition:1st ed. 1993.
Series:Progress in Theoretical Computer Science
Springer eBook Collection.
Subjects:
Computer science—Mathematics.
Applied mathematics.
Engineering mathematics.
Combinatorics.
Algorithms.
Computer mathematics.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Login for hold information

‌

Click to view e-book

Online

Holdings details from Online
Call Number: E-Book
Status: Available

Similar Items