No Words Wasted Sale
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Visit our stores


    Recently Viewed clear list


    Required Reading | January 16, 2015

    Required Reading: Books That Changed Us



    We tend to think of reading as a cerebral endeavor, but every once in a while, it can spur action. The following books — ranging from... Continue »

    spacer
Qualifying orders ship free.
$169.00
New Hardcover
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
1 Remote Warehouse Computers Reference- General

More copies of this ISBN

Graph Isomorphism Problem: Its Structural Complexity

by

Graph Isomorphism Problem: Its Structural Complexity Cover

 

Synopses & Reviews

Publisher Comments:

It also uses the problem to illustrate important concepts in structural complexity, providing a look into the more general theory. 'The book is basically self-contained; the only prerequisite for reading it is some elementary knowledge from Complexity Theory and Probability Theory. Its level of presentation makes it eminently suitable for a seminar or graduate course devoted to the problem, or as a rich source of examples for a standard graduate course in Complexity Theory.

Book News Annotation:

The question is whether or not an efficient algorithm exists by which to determine whether or not two given graphs are isomorphic, that is, whether nodes can be mapped from one to the other without violating the edge connections. The answer, so far, is yes, but only by assuming some hypotheses that might well turn out to be false. For readers with a graduate-level understanding of complexity and probability theory.
Annotation c. Book News, Inc., Portland, OR (booknews.com)

Description:

Includes bibliographical references (p. [149]-157) and index.

Product Details

ISBN:
9780817636807
Author:
Kobler, Johannes
Publisher:
Birkhauser
Author:
Toran, J.
Author:
Schning, U.
Author:
Koebler, J.
Author:
Schöning, U.
Author:
Schoening, U.
Author:
Kobler, J.
Location:
Boston :
Subject:
General
Subject:
Computer Science
Subject:
Applied
Subject:
Graphic Methods
Subject:
Graph theory
Subject:
Computational complexity
Subject:
Isomorphisms (Mathematics)
Subject:
Isomorphisms
Subject:
General Computers
Subject:
Math Applications in Computer Science
Subject:
APPLICATIONS OF MATHEMATICS
Subject:
Combinatorics
Subject:
Algorithm Analysis and Problem Complexity
Subject:
Computational Mathematics and Numerical Analysis
Subject:
Personal Computers-General
Subject:
Data processing
Copyright:
Edition Number:
1
Edition Description:
Book
Series:
Progress in theoretical computer science
Series Volume:
133
Publication Date:
19930701
Binding:
HARDCOVER
Language:
English
Illustrations:
Yes
Pages:
167
Dimensions:
235 x 155 mm 930 gr

Other books you might like

  1. Kluwer International Series in... New Hardcover $339.25

Related Subjects

Computers and Internet » Computers Reference » General
Computers and Internet » Personal Computers » General
Computers and Internet » Software Engineering » Algorithms
Science and Mathematics » Mathematics » Applied
Science and Mathematics » Mathematics » General

Graph Isomorphism Problem: Its Structural Complexity New Hardcover
0 stars - 0 reviews
$169.00 In Stock
Product details 167 pages Birkhauser Boston - English 9780817636807 Reviews:
spacer
spacer
  • back to top

FOLLOW US ON...

     
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.