Non-Fiction Books:

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Format:

Hardback
$437.00
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
Free Delivery with Primate
Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

4 payments of $109.25 with Afterpay Learn more

6 weekly interest-free payments of $72.83 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 17-27 June using International Courier

Description

Descriptive complexity theory establishes a connection between the computational complexity of algorithmic problems (the computational resources required to solve the problems) and their descriptive complexity (the language resources required to describe the problems). This groundbreaking book approaches descriptive complexity from the angle of modern structural graph theory, specifically graph minor theory. It develops a 'definable structure theory' concerned with the logical definability of graph theoretic concepts such as tree decompositions and embeddings. The first part starts with an introduction to the background, from logic, complexity, and graph theory, and develops the theory up to first applications in descriptive complexity theory and graph isomorphism testing. It may serve as the basis for a graduate-level course. The second part is more advanced and mainly devoted to the proof of a single, previously unpublished theorem: properties of graphs with excluded minors are decidable in polynomial time if, and only if, they are definable in fixed-point logic with counting.

Author Biography:

Martin Grohe is a Professor of Theoretical Computer Science at RTWH Aachen University, Germany, where he holds the Chair for Logic and the Theory of Discrete Systems. His research interests are in theoretical computer science interpreted broadly, including logic, algorithms and complexity, graph theory, and database theory.
Release date NZ
August 17th, 2017
Author
Audience
  • Professional & Vocational
Illustrations
Worked examples or Exercises; 25 Halftones, black and white; 35 Line drawings, black and white
Pages
554
Dimensions
160x235x36
ISBN-13
9781107014527
Product ID
27215837

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Help & options

Filed under...