Libros bestsellers hasta 50% dcto  Ver más

menu

0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional
portada Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic) (in English)
Type
Physical Book
Year
2017
Language
English
Pages
554
Format
Hardcover
ISBN13
9781107014527
Edition No.
1

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

Martin Grohe (Author) · Cambridge University Press · Hardcover

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

Physical Book

$ 183.42

$ 205.00

You save: $ 21.58

11% discount
  • Condition: New
It will be shipped from our warehouse between Monday, June 03 and Tuesday, June 04.
You will receive it anywhere in United States between 1 and 3 business days after shipment.

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

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

All books in our catalog are Original.
The book is written in English.
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