Hallo! Tracked shipping to Netherlands with Delivery Duty Paid for just €7 

Ship to
Netherlands
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic)
Type
Physical Book
Publisher
Author
Year
2017
Language
English
Pages
554
Format
Hardcover
ISBN13
9781107014527
Edition No.
1
Categories

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

Martin Grohe (Author) · Cambridge University Press · Hardcover

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

Cheaper New Book Imported to Netherlands
Delivery: 01 Sep - 03 Sep Shipping: 7 to 8 business days.
€ 236,16
Faster New Book Imported to Netherlands
Delivery: 24 Aug - 25 Aug Shipping: 2 to 2 business days.
€ 250,33
Import costs and 9% BTW included in the price ✅
€ 236,16

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

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

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Hardcover.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews