Items related to Descriptive Complexity, Canonisation, and Definable...
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory: 47 (Lecture Notes in Logic, Series Number 47) - Hardcover
Book 35 of 39: Lecture Notes in Logic
Synopsis
This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory.
"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.
Search results for Descriptive Complexity, Canonisation, and Definable...
Stock Image
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic, Series Number 47)
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
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
Stock Image
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Published by
Cambridge University Press, 2017
ISBN 10: 1107014522
ISBN 13: 9781107014527
Used
Hardcover
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
HRD. Condition: Used - Very Good. Used - Like New Book. Shipped from UK. Established seller since 2000. Seller Inventory # P1-9781107014527
Buy Used
£ 152.28
£ 5.87 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory: 47 (Lecture Notes in Logic, Series Number 47)
Published by
Cambridge University Press 2017-08-17, 2017
ISBN 10: 1107014522
ISBN 13: 9781107014527
New
Hardcover
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: New. Seller Inventory # 6666-GRD-9781107014527
Buy New
£ 172.28
£ 15.49 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic, Series Number 47)
Published by
Cambridge University Press, 2017
ISBN 10: 1107014522
ISBN 13: 9781107014527
New
Hardcover
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9781107014527_new
Buy New
£ 176.33
£ 11.98 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic, Series Number 47)
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
Condition: New. Seller Inventory # I-9781107014527
Stock Image
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic, Series Number 47)
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
Hardcover. Condition: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Seller Inventory # ERICA77311070145226
Stock Image
Lecture Notes in Logic: Series Number 47: Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Published by
Cambridge University Press, 2017
ISBN 10: 1107014522
ISBN 13: 9781107014527
New
Hardcover
First Edition
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory. Series: Lecture Notes in Logic. Num Pages: 530 pages, 60 b/w illus. BIC Classification: PBCD; PBD; PBV; UMB; UYA. Category: (P) Professional & Vocational. Dimension: 228 x 152. . . 2017. 1st Edition. Hardcover. . . . . Seller Inventory # V9781107014527
Stock Image
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
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
Hardcover. Condition: Brand New. 543 pages. 9.00x6.25x1.50 inches. In Stock. Seller Inventory # __1107014522
Buy New
£ 213.08
£ 12.50 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Published by
Cambridge University Press, GB, 2017
ISBN 10: 1107014522
ISBN 13: 9781107014527
New
Hardcover
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
Hardback. Condition: New. 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. Seller Inventory # LU-9781107014527
Buy New
£ 227.37
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Published by
Cambridge University Press Sep 2017, 2017
ISBN 10: 1107014522
ISBN 13: 9781107014527
New
Hardcover
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Neuware - 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. Seller Inventory # 9781107014527