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

Price History & Forecast

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

Historical

Generating forecast...

Price Distribution

Price distribution over 27 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £116 (21 days, 77.8%)

Price range: £116 - £135

Price levels: 2 different prices over 27 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)

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Descriptive Complexity (Texts in Computer Science)

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

Computable Structure Theory: Within the Arithmetic (Perspectives in Logic)

Computational Complexity: A Conceptual Perspective

Cambridge Description Logic Handbook - Theory and Applications

Logic of Typed Feature Structures: With Applications to Unification Grammars, Logic Programs and Constraint Resolution: 32 (Cambridge Tracts in Theoretical Computer Science, Series Number 32)

Effective Mathematics of the Uncountable: 41 (Lecture Notes in Logic, Series Number 41)

Logical Foundations of Proof Complexity (Perspectives in Logic)

Proof Complexity Generators: Series Number 497 (London Mathematical Society Lecture Note Series, Series Number 497)

An Introduction to Description Logic

Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)

Invariant Descriptive Set Theory (Pure and Applied Mathematics)

On Sets and Graphs: Perspectives on Logic and Combinatorics

Homogeneous Ordered Graphs, Metrically Homogeneous Graphs, and Beyond: Volume 2, 3-Multi-graphs and 2-Multi-tournaments: 54 (Lecture Notes in Logic, Series Number 54)

The Mathematics of Logic: A Guide to Completeness Theorems and their Applications

Invariant Descriptive Set Theory (Pure and Applied Mathematics)

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

Data Refinement: Model-Oriented Proof Methods and their Comparison: 47 (Cambridge Tracts in Theoretical Computer Science, Series Number 47)

Lectures on Infinitary Model Theory: 46 (Lecture Notes in Logic, Series Number 46)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Analytic Combinatorics

Computational Complexity: A Modern Approach

Computability Theory: An Introduction to Recursion Theory

Notes on Logic and Set Theory (Cambridge Mathematical Textbooks)