BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic)

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic)

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Stock photo: cover may vary

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic) Hardback -

by Martin Grohe

Add to wish list
  • New
  • Hardback
New

Description

pp. 530 . Hardback. New.
Ask the seller a question Add to wish list
A$488.98
A$5.82 Delivery within USA
Standard delivery: 9 to 14 days
More delivery options
Ships from Cold Books (New York, United States)

Details

  • Title Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic)
  • Author Martin Grohe
  • Binding Hardback
  • Edition Hardback
  • Condition New
  • Pages 554
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press
  • Publication date pp. 530
  • Features Bibliography, Index
  • Bookseller's Inventory # 6375200688
  • ISBN 9781107014527 / 1107014522
  • Weight 1.97 lbs (0.89 kg)
  • Dimensions 9.47 x 6.46 x 1.4 in (24.05 x 16.41 x 3.56 cm)
  • Category Mathematics
  • Library of Congress subjects Graph theory
  • Library of Congress Catalogue Number 2016053731
  • Dewey Decimal Code 511.5
  • Quantity available 4

About Cold Books New York, United States

Biblio member since 2012

Terms of Sale: 30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Cold Books

Reader reviews for Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic)

From the publisher

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.
tracking-