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 The Value of Milton by Martin Grohe
Cover of the book The Governance of EU Fundamental Rights by Martin Grohe
Cover of the book The Gravity Model in International Trade by Martin Grohe
Cover of the book Husserl's Transcendental Phenomenology by Martin Grohe
Cover of the book Theory and Synthesis of Linear Passive Time-Invariant Networks by Martin Grohe
Cover of the book Computing for Biologists by Martin Grohe
Cover of the book Stalin and the Struggle for Supremacy in Eurasia by Martin Grohe
Cover of the book Human Rights and the Ethics of Globalization by Martin Grohe
Cover of the book The Dating Game by Martin Grohe
Cover of the book The Politics of Protest in Hybrid Regimes by Martin Grohe
Cover of the book John Rawls: Reticent Socialist by Martin Grohe
Cover of the book The Global Transformation by Martin Grohe
Cover of the book The Cambridge Companion to Charles Dickens by Martin Grohe
Cover of the book Case Studies in Assisted Reproduction by Martin Grohe
Cover of the book Industrial Crystallization 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