Articoli correlati a Descriptive Complexity, Canonisation, and Definable...
Sinossi
This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Informazioni sull?autore
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 210,25
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costiRisultati della ricerca per Descriptive Complexity, Canonisation, and Definable...
Foto dell'editore
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic, Series Number 47)
Editore:
Cambridge University Press, 2017
ISBN 10: 1107014522
ISBN 13: 9781107014527
Antico o usato
Rilegato
Prima edizione
Da: Prior Books Ltd, Cheltenham, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. 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. Codice articolo 202091
Quantità: 2 disponibili
Immagini fornite dal venditore
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Gebunden. Condizione: 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. Codice articolo 150290005
Quantità: Più di 20 disponibili
Foto dell'editore
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Print on DemandDa: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Brand New. 543 pages. 9.00x6.25x1.50 inches. In Stock. This item is printed on demand. Codice articolo __1107014522
Quantità: 1 disponibili
Foto dell'editore
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic, Series Number 47)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9781107014527
Quantità: Più di 20 disponibili
Foto dell'editore
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic, Series Number 47)
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
Hardcover. Condizione: New. New. book. Codice articolo ERICA77311070145226
Quantità: 1 disponibili
Foto dell'editore
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Hardcover)
Editore:
Cambridge University Press, Cambridge, 2017
ISBN 10: 1107014522
ISBN 13: 9781107014527
Nuovo
Rilegato
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Codice articolo 9781107014527
Quantità: 1 disponibili
Foto dell'editore
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Hardcover)
Editore:
Cambridge University Press, Cambridge, 2017
ISBN 10: 1107014522
ISBN 13: 9781107014527
Nuovo
Rilegato
Da: Grand Eagle Retail, Mason, OH, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9781107014527
Quantità: 1 disponibili
Foto dell'editore
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Brand New. 543 pages. 9.00x6.25x1.50 inches. In Stock. Codice articolo x-1107014522
Quantità: 2 disponibili