This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Prior Books Ltd, Cheltenham, Reino Unido
Hardcover. Condición: 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 ref. del artículo: 202091
Cantidad disponible: 2 disponibles
Librería: Best Price, Torrance, CA, Estados Unidos de America
Condición: New. SUPER FAST SHIPPING. Nº de ref. del artículo: 9781107014527
Cantidad disponible: 4 disponibles
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Hardcover. Condición: 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 ref. del artículo: 9781107014527
Cantidad disponible: 1 disponibles
Librería: DeckleEdge LLC, Albuquerque, NM, Estados Unidos de America
hardcover. Condición: new. Nº de ref. del artículo: Shelfdream1107014522
Cantidad disponible: 1 disponibles
Librería: Mispah books, Redhill, SURRE, Reino Unido
Hardcover. Condición: New. New. book. Nº de ref. del artículo: ERICA77311070145226
Cantidad disponible: 1 disponibles
Librería: moluna, Greven, Alemania
Gebunden. Condición: 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 ref. del artículo: 150290005
Cantidad disponible: Más de 20 disponibles
Librería: CitiRetail, Stevenage, Reino Unido
Hardcover. Condición: 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 ref. del artículo: 9781107014527
Cantidad disponible: 1 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. 543 pages. 9.00x6.25x1.50 inches. In Stock. Nº de ref. del artículo: x-1107014522
Cantidad disponible: 2 disponibles