Lingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Prior Books Ltd, Cheltenham, Regno Unito
Prima edizione
EUR 47,74
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: 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.
Lingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
EUR 181,73
Quantità: 1 disponibili
Aggiungi al carrelloHRD. Condizione: Used - Very Good. Used - Like New Book. Shipped from UK. Established seller since 2000.
Lingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 210,43
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. In.
Lingua: Inglese
Editore: Cambridge University Press 2017-08-17, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Chiron Media, Wallingford, Regno Unito
EUR 205,60
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: California Books, Miami, FL, U.S.A.
EUR 229,66
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 204,07
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Lingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Prima edizione
EUR 223,95
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: 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. . . . .
Lingua: Inglese
Editore: Cambridge University Press, GB, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Rarewaves.com USA, London, LONDO, Regno Unito
EUR 263,17
Quantità: 1 disponibili
Aggiungi al carrelloHardback. Condizione: 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.
Da: moluna, Greven, Germania
EUR 220,36
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. 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.
Lingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 530.
Lingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Kennys Bookstore, Olney, MD, U.S.A.
Condizione: 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. . . . . Books ship from the US and Ireland.
Lingua: Inglese
Editore: Cambridge University Press Sep 2017, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 228,69
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Neuware - This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory.
Lingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Revaluation Books, Exeter, Regno Unito
EUR 304,92
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 543 pages. 9.00x6.25x1.50 inches. In Stock.
Lingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: preigu, Osnabrück, Germania
EUR 243,10
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Descriptive Complexity, Canonisation, and Definable Graph Structure Theory | Martin Grohe | Buch | Lecture Notes in Logic | Gebunden | Englisch | 2017 | Cambridge University Press | EAN 9781107014527 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu.
Lingua: Inglese
Editore: Cambridge University Press, GB, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Rarewaves.com UK, London, Regno Unito
EUR 249,50
Quantità: 1 disponibili
Aggiungi al carrelloHardback. Condizione: 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.
Lingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Revaluation Books, Exeter, Regno Unito
EUR 223,28
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 543 pages. 9.00x6.25x1.50 inches. In Stock. This item is printed on demand.
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: CitiRetail, Stevenage, Regno Unito
EUR 258,35
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: 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.
Lingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Majestic Books, Hounslow, Regno Unito
EUR 298,85
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 530.
Lingua: Inglese
Editore: Cambridge University Press, 2017
ISBN 10: 1107014522 ISBN 13: 9781107014527
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 298,34
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 530.