BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory Hardback - 2017

by Grohe, Martin (RWTH Aachen University, Germany)

Add to wish list
  • New
  • Hardback
New

Description

Hardback. New. New Book; Fast Shipping from UK; Not signed; Not First Edition; This groundbreaking, yet accessible book contains original results on the interaction between graph theory and computational complexity using methods from finite model theory. As well as a wealth of new, previously unpublished results,
Ask the seller a question Add to wish list
A$367.52
A$15.55 Delivery to USA
Standard delivery: 7 to 12 days
More delivery options
Ships from Ria Christie Collections (Greater London, United Kingdom)

Details

About Ria Christie Collections Greater London, United Kingdom

Biblio member since 2014

Hello We are professional online booksellers. We sell mostly new books and textbooks and we do our best to provide a competitive price. We are based in Greater London, UK. We pride ourselves by providing a good customer service throughout, shipping the items quickly and replying to customer queries promptly. Ria Christie Collections

Terms of Sale:

30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Ria Christie Collections

Reader reviews for Descriptive Complexity, Canonisation, and Definable Graph Structure Theory

From the publisher

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