Descriptive Complexity, Canonisation, and Definable Graph Structure Theory

Nonfiction, Science & Nature, Mathematics, Logic, Computers, General Computing
Cover of the book Descriptive Complexity, Canonisation, and Definable Graph Structure Theory by Martin Grohe, Cambridge University Press
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Martin Grohe ISBN: 9781108227988
Publisher: Cambridge University Press Publication: August 17, 2017
Imprint: Cambridge University Press Language: English
Author: Martin Grohe
ISBN: 9781108227988
Publisher: Cambridge University Press
Publication: August 17, 2017
Imprint: Cambridge University Press
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Cambridge University Press

Cover of the book Property and Dispossession by Martin Grohe
Cover of the book An Introduction to Swaminarayan Hindu Theology by Martin Grohe
Cover of the book Speech and Language Therapy by Martin Grohe
Cover of the book International Relations in Political Thought by Martin Grohe
Cover of the book Rule of Law for Nature by Martin Grohe
Cover of the book A Physical Introduction to Suspension Dynamics by Martin Grohe
Cover of the book Life's Solution by Martin Grohe
Cover of the book Environmental and Nuclear Networks in the Global South by Martin Grohe
Cover of the book Magnetic Memory by Martin Grohe
Cover of the book Flowers on the Tree of Life by Martin Grohe
Cover of the book Cicero: 'Pro Sexto Roscio' by Martin Grohe
Cover of the book Private International Law in Commonwealth Africa by Martin Grohe
Cover of the book Knowledge and Power in Prehistoric Societies by Martin Grohe
Cover of the book Kant's 'Critique of Practical Reason' by Martin Grohe
Cover of the book Algebraic Groups by Martin Grohe
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy