- STAFF PICKS
- GIFTS + GIFT CARDS
- SELL BOOKS
- FIND A STORE
Ships in 1 to 3 days
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
More copies of this ISBN
Other titles in the Progress in Theoretical Computer Science series:
Graph Isomorphism Problem: Its Structural Complexityby Johannes Kobler
Synopses & Reviews
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)
Includes bibliographical references (p. -157) and index.
What Our Readers Are Saying
Other books you might like
Computers and Internet » Computers Reference » General