Descriptive Complexity, Canonisation, and Definable Graph Structure Theory - Couverture rigide
Livre 35 sur 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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Résultats de recherche pour Descriptive Complexity, Canonisation, and Definable...
Image d'archives
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic, Series Number 47)
Edité par
Cambridge University Press, 2017
ISBN 10 : 1107014522
ISBN 13 : 9781107014527
Ancien ou d'occasion
Couverture rigide
Edition originale
Vendeur : Prior Books Ltd, Cheltenham, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : 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. N° de réf. du vendeur 202091
Acheter D'occasion
EUR 46,63
Frais de port :
EUR 24,90
De Royaume-Uni vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image d'archives
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic, Series Number 47)
Edité par
Cambridge University Press, 2017
ISBN 10 : 1107014522
ISBN 13 : 9781107014527
Neuf
Couverture rigide
Vendeur : Best Price, Torrance, CA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. SUPER FAST SHIPPING. N° de réf. du vendeur 9781107014527
Acheter neuf
EUR 181,59
Frais de port :
EUR 7,78
Vers Etats-Unis
Quantité disponible : 4 disponible(s)
Image d'archives
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Hardcover)
Edité par
Cambridge University Press, Cambridge, 2017
ISBN 10 : 1107014522
ISBN 13 : 9781107014527
Neuf
Couverture rigide
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : 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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9781107014527
Acheter neuf
EUR 215,99
Frais de port :
Gratuit
Vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic, Series Number 47) - Grohe, Martin
Edité par
Cambridge University Press, 2017
ISBN 10 : 1107014522
ISBN 13 : 9781107014527
Neuf
Couverture rigide
Vendeur : DeckleEdge LLC, Albuquerque, NM, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
hardcover. Etat : new. N° de réf. du vendeur Shelfdream1107014522
Acheter neuf
EUR 216
Frais de port :
Gratuit
Vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Edité par
Cambridge University Press, 2017
ISBN 10 : 1107014522
ISBN 13 : 9781107014527
Neuf
Couverture rigide
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : Brand New. 543 pages. 9.00x6.25x1.50 inches. In Stock. This item is printed on demand. N° de réf. du vendeur __1107014522
Acheter neuf
EUR 207,82
Frais de port :
EUR 14,15
De Royaume-Uni vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic, Series Number 47)
Edité par
Cambridge University Press, 2017
ISBN 10 : 1107014522
ISBN 13 : 9781107014527
Neuf
Couverture rigide
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Hardcover. Etat : New. New. book. N° de réf. du vendeur ERICA77311070145226
Acheter neuf
EUR 199,34
Frais de port :
EUR 28,29
De Royaume-Uni vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
impression à la demandeVendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Gebunden. Etat : 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. N° de réf. du vendeur 150290005
Acheter neuf
EUR 210,25
Frais de port :
EUR 48,99
De Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Hardcover)
Edité par
Cambridge University Press, Cambridge, 2017
ISBN 10 : 1107014522
ISBN 13 : 9781107014527
Neuf
Couverture rigide
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. N° de réf. du vendeur 9781107014527
Acheter neuf
EUR 234,88
Frais de port :
EUR 41,88
De Royaume-Uni vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Edité par
Cambridge University Press, 2017
ISBN 10 : 1107014522
ISBN 13 : 9781107014527
Neuf
Couverture rigide
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : Brand New. 543 pages. 9.00x6.25x1.50 inches. In Stock. N° de réf. du vendeur x-1107014522
Acheter neuf
EUR 286,63
Frais de port :
EUR 14,15
De Royaume-Uni vers Etats-Unis
Quantité disponible : 2 disponible(s)