Items related to Descriptive Complexity, Canonisation, and Definable...

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

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

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.

"synopsis" may belong to another edition of this title.

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.

"About this title" may belong to another edition of this title.

Buy Used

Condition: As New
A firm, square and tight hardback...
View this item

US$ 29.59 shipping from United Kingdom to U.S.A.

Destination, rates & speeds

Search results for Descriptive Complexity, Canonisation, and Definable...

Stock Image

Grohe, Martin
Published by Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Used Hardcover First Edition

Seller: Prior Books Ltd, Cheltenham, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardcover. Condition: Like New. First Edition. 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

Contact seller

Buy Used

US$ 55.41
Convert currency
Shipping: US$ 29.59
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 2 available

Add to basket

Stock Image

Martin Grohe
ISBN 10: 1107014522 ISBN 13: 9781107014527
New Hardcover

Seller: Grand Eagle Retail, Mason, OH, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardcover. Condition: new. Hardcover. 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. This groundbreaking, yet accessible book contains original results on the interaction between graph theory and computational complexity using methods from finite model theory. As well as a wealth of new, previously unpublished results, the author also gives an account of the established results in the area. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781107014527

Contact seller

Buy New

US$ 241.99
Convert currency
Shipping: FREE
Within U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Grohe, Martin
Published by Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
New Hardcover

Seller: California Books, Miami, FL, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # I-9781107014527

Contact seller

Buy New

US$ 242.00
Convert currency
Shipping: FREE
Within U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Martin Grohe
Published by Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
New Hardcover
Print on Demand

Seller: Revaluation Books, Exeter, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardcover. Condition: Brand New. 543 pages. 9.00x6.25x1.50 inches. In Stock. This item is printed on demand. Seller Inventory # __1107014522

Contact seller

Buy New

US$ 246.96
Convert currency
Shipping: US$ 13.45
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Grohe, Martin
Published by Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
New Hardcover

Seller: Mispah books, Redhill, SURRE, United Kingdom

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Hardcover. Condition: New. New. book. Seller Inventory # ERICA77311070145226

Contact seller

Buy New

US$ 236.89
Convert currency
Shipping: US$ 33.62
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Seller Image

Grohe, Martin
Published by CAMBRIDGE, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
New Hardcover
Print on Demand

Seller: moluna, Greven, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This groundbreaking, yet accessible book contains original results on the interaction between graph theory and computational complexity using methods from finite model theory. As well as a wealth of new, previously unpublished results, the author also gives. Seller Inventory # 150290005

Contact seller

Buy New

US$ 252.18
Convert currency
Shipping: US$ 57.05
From Germany to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Martin Grohe
ISBN 10: 1107014522 ISBN 13: 9781107014527
New Hardcover

Seller: CitiRetail, Stevenage, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardcover. Condition: new. Hardcover. 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. This groundbreaking, yet accessible book contains original results on the interaction between graph theory and computational complexity using methods from finite model theory. As well as a wealth of new, previously unpublished results, the author also gives an account of the established results in the area. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9781107014527

Contact seller

Buy New

US$ 278.43
Convert currency
Shipping: US$ 49.76
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Martin Grohe
Published by Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
New Hardcover

Seller: Revaluation Books, Exeter, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardcover. Condition: Brand New. 543 pages. 9.00x6.25x1.50 inches. In Stock. Seller Inventory # x-1107014522

Contact seller

Buy New

US$ 332.38
Convert currency
Shipping: US$ 13.45
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 2 available

Add to basket