Descriptive Complexity, Canonisation, and Definable Graph Structure Theory: 47 (Lecture Notes in Logic, Series Number 47) - Image 1

£115.92

Cambridge University Press Descriptive Complexity, Canonisation, and Definable Graph Structure Theory: 47 (Lecture Notes in Logic, Series Number 47)

Name: Descriptive Complexity, Canonisation, and Definable Graph Structure Theory: 47 (Lecture Notes in Logic, Series Number 47)
Brand: Cambridge University Press
Price: 115.92 GBP
Availability: InStock

Algorithms

This is the usual price. Wait for it to drop, or tell us your number.

£116 today · usual range £0–£0 · best ever £99

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 622 days • 622 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 622 days • 5 price ranges

Days at Price

Current Price

Price Analysis

Most common range: £128-135 (210 days, 33.8%)

Price range: £99 - £135

Price levels: 5 price ranges over 622 days

Description

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.

Product Specifications

Brand: Cambridge University Press
Format: Hardcover
ASIN: 1107014522
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 17 August 2017
Listed Since: 18 December 2016

Barcode

No barcode data available

Cambridge University Press Descriptive Complexity, Canonisation, and Definable Graph Structure Theory: 47 (Lecture Notes in Logic, Series Number 47)

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)

Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach: 138 (Encyclopedia of Mathematics and its Applications, Series Number 138)

Descriptive Complexity (Texts in Computer Science)

Computability and Logic

Algebra, Meaning, and Computation: Essays dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday: 4060 (Lecture Notes in Computer Science, 4060)

Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction (Springer Monographs in Mathematics)

Computational Logic: 165 (NATO ASI Subseries F:, 165)

Complexity, Logic, and Recursion Theory: 187 (Lecture Notes in Pure and Applied Mathematics)

Computability Theory: 26 (Chapman Hall/CRC Mathematics Series)

Mathematical Aspects of Logic Programming Semantics (Chapman & Hall/CRC Studies in Informatics Series)

Elements of Finite Model Theory (Texts in Theoretical Computer Science. An EATCS Series)

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Formal Concept Analysis: Mathematical Foundations

A Hierarchy of Turing Degrees - Princeton University Press

Decidability of Logical Theories and Their Combination (Studies in Universal Logic)

Logic and Language Models for Computer Science: Third Edition

Concise Guide to Formal Methods: Theory, Fundamentals and Industry Applications (Undergraduate Topics in Computer Science)

Mathematical Logic: 291 (Graduate Texts in Mathematics, 291)

Logic Colloquium '95: Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, held in Haifa, Israel, August 9–18, 1995: 11 (Lecture Notes in Logic, Series Number 11)

Models and Computability: Invited Papers from Logic Colloquium '97, European Meeting of the Association for Symbolic Logic, Leeds, July 1997: 259 ... Lecture Note Series, Series Number 259)

Logics for Computer and Data Sciences, and Artificial Intelligence: 992 (Studies in Computational Intelligence, 992)

Programs as Diagrams: From Categorical Computability to Computable Categories (Theory and Applications of Computability)

Logical Foundations of Proof Complexity (Perspectives in Logic)