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 Mechanics of Solids and Materials by Martin Grohe
Cover of the book The Joy of Science by Martin Grohe
Cover of the book Conflict and Housing, Land and Property Rights by Martin Grohe
Cover of the book Multiagent Systems by Martin Grohe
Cover of the book The Economics of John Kenneth Galbraith by Martin Grohe
Cover of the book The Cambridge Companion to Ancient Rhetoric by Martin Grohe
Cover of the book Consumer Financial Dispute Resolution in a Comparative Context by Martin Grohe
Cover of the book Science and the State by Martin Grohe
Cover of the book American Grand Strategy in the Mediterranean during World War II by Martin Grohe
Cover of the book Bayesian Speech and Language Processing by Martin Grohe
Cover of the book Rhetoric and Composition by Martin Grohe
Cover of the book Internet Jurisdiction and Choice of Law by Martin Grohe
Cover of the book The Cambridge Companion to Boethius by Martin Grohe
Cover of the book Categorical Homotopy Theory by Martin Grohe
Cover of the book Primary Mathematics 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