Descriptive Complexity, Canonisation, and Definable Graph Structure Theory

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory - Lecture Notes in Logic

eBook (30 Aug 2017)

Not available for sale

Instant Download - PDF (with DRM)

- Read on your eReader, tablet, mobile, Apple Mac or a PC.
- Currently not compatible with Amazon Kindle.
- PDF's require Adobe Digital Editions.

Publisher's Synopsis

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.

About the Publisher

Cambridge University Press

Cambridge University Press dates from 1534 and is part of the University of Cambridge. We further the University's mission by disseminating knowledge in the pursuit of education, learning and research at the highest international levels of excellence.

Book information

ISBN: 9781108234467
Publisher: Cambridge University Press
Imprint: Cambridge University Press
Pub date:
DEWEY: 511.5
DEWEY edition: 23
Language: English