The Graph Isomorphism Problem: Its Structural Complexity (Progress in Theoretical Computer Science) - Image 1

£71.59

Birkhauser The Graph Isomorphism Problem: Its Structural Complexity (Progress in Theoretical Computer Science)

Name: The Graph Isomorphism Problem: Its Structural Complexity (Progress in Theoretical Computer Science)
Brand: Birkhauser
Price: 71.59 GBP
Availability: InStock

Algorithms

It has never been this cheap. We have no record of a lower price.

£72 today · cheaper than every other day in the last 3 months

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 43 days • 43 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 43 days • 3 price levels

Days at Price

Current Price

Price Analysis

Most common price: £73 (26 days, 60.5%)

Price range: £72 - £81

Price levels: 3 different prices over 43 days

Description

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.

Key Features

Used Book in Good Condition

Product Specifications

Brand: Birkhauser
Format: hardcover
ASIN: 0817636803
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 01 July 1993
Listed Since: 12 January 2007

Barcode

No barcode data available

Birkhauser The Graph Isomorphism Problem: Its Structural Complexity (Progress in Theoretical Computer Science)

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26)

The Complexity Theory Companion (Texts in Theoretical Computer Science. An EATCS Series)

Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000: 4 (De Gruyter Series in Logic & its Applications, 4)

Computational Complexity: A Conceptual Perspective: 0

Complexity Theory Retrospective II (Springer Series in Statistics)

Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)

Complex Graphs and Networks (CBMS Regional Conference Series in Mathematics)

LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings: 10807 (Lecture Notes in Computer Science, 10807)

Mathematics and Computer Science: Algorithims, Trees, Combinatorics and Probabilities (Trends in Mathematics)

Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)

Innovative Internet Computing Systems: Second International Workshop, IICS 2002, Kühlungsborn, Germany, June 20-22, 2002, Proceedings: 2346 (Lecture Notes in Computer Science, 2346)

Springer - Patterns in Permutations and Words Book

The Nature of Computation

An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)

Computational Complexity: A Modern Approach

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory: 47 (Lecture Notes in Logic, Series Number 47)

Mathematical Foundations of Computer Science 2009: 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009, ... (Lecture Notes in Computer Science, 5734)

Advances in Algorithms, Languages, and Complexity

Comprehensive Mathematics for Computer Scientists 1: Sets and Numbers, Graphs and Algebra, Logic and Machines, Linear Geometry (Universitext)

Mathematical Foundations of Computer Science

Computational Complexity: A Quantitative Perspective (Volume 196) (North-Holland Mathematics Studies, Volume 196)

Routledge Complexity and Organization: Readings and Conversations

Graph Theory and Its Applications (Textbooks in Mathematics)

Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabilities (Trends in Mathematics)