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

Grohe, Martin

ISBN 10: 1107014522 / ISBN 13: 9781107014527

Published by Cambridge University Press, 2017

About this Item

A firm, square and tight hardback with strong joints, just showing a few very minor hardly noticeable bumps and some mild cosmetic wear. Hence a non-text page is stamped 'damaged'. Despite such this book is actually in nearly new condition. Thus the contents are crisp, fresh and clean with no pen-marks. Not from a library so no such stamps or labels. Now offered for sale at a very reasonable price.

Seller Inventory # 202091

Bibliographic Details

• Title: Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic, Series Number 47)
• Publisher: Cambridge University Press
• Publication Date: 2017
• Language: English
• ISBN 10: 1107014522
• ISBN 13: 9781107014527
• Binding: Hardcover
• Edition: First Edition.
• Condition: Like New

About this title

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 Author

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.