This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Prior Books Ltd, Cheltenham, Vereinigtes Königreich
Hardcover. Zustand: 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. Bestandsnummer des Verkäufers 202091
Anzahl: 2 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Bestandsnummer des Verkäufers ria9781107014527_new
Anzahl: 1 verfügbar
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
Hardcover. Zustand: New. Bestandsnummer des Verkäufers 6666-GRD-9781107014527
Anzahl: 1 verfügbar
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Hardcover. Zustand: 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. Bestandsnummer des Verkäufers 9781107014527
Anbieter: California Books, Miami, FL, USA
Zustand: New. Bestandsnummer des Verkäufers I-9781107014527
Anzahl: Mehr als 20 verfügbar
Anbieter: Speedyhen, Hertfordshire, Vereinigtes Königreich
Zustand: NEW. Bestandsnummer des Verkäufers NW9781107014527
Anzahl: 1 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Hardcover. Zustand: Brand New. 543 pages. 9.00x6.25x1.50 inches. In Stock. This item is printed on demand. Bestandsnummer des Verkäufers __1107014522
Anzahl: 1 verfügbar
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
Hardcover. Zustand: New. New. book. Bestandsnummer des Verkäufers ERICA77311070145226
Anzahl: 1 verfügbar
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Zustand: 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. . . . . Bestandsnummer des Verkäufers V9781107014527
Anzahl: 1 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: 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. Bestandsnummer des Verkäufers 150290005
Anzahl: 1 verfügbar