Fixed-point definability and polynomial time on chordal graphs and line graphs

DOI10.1007/978-3-642-15025-8_17zbMATH Open1287.68064arXiv1001.2572OpenAlexW2963086889MaRDI QIDQ3586010FDOQ3586010

Authors: Martin Grohe 

Publication date: 3 September 2010

Published in: Fields of Logic and Computation (Search for Journal in Brave)

Abstract: The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems in finite model theory and database theory. Partial results have been obtained for specific classes of structures. In particular, it is known that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. The introductory part of this paper is a short survey of the state-of-the-art in the quest for a logic capturing polynomial time. The main part of the paper is concerned with classes of graphs defined by excluding induced subgraphs. Two of the most fundamental such classes are the class of chordal graphs and the class of line graphs. We prove that capturing polynomial time on either of these classes is as hard as capturing it on the class of all graphs. In particular, this implies that fixed-point logic with counting does not capture polynomial time on these classes. Then we prove that fixed-point logic with counting does capture polynomial time on the class of all graphs that are both chordal and line graphs.

Full work available at URL: https://arxiv.org/abs/1001.2572

Recommendations

• Capturing polynomial time using modular decomposition
• scientific article; zbMATH DE number 7204318
• Capturing polynomial time using modular decomposition
• scientific article; zbMATH DE number 7080199
• Fixed-point definability and polynomial time on graphs with excluded minors

zbMATH Keywords

descriptive complexity theoryfixed-point logic

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Cites Work

• Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
• Fixed-point extensions of first-order logic
• Upper bounds to the clique width of graphs
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• Approximating clique-width and branch-width
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fixed-point definability and polynomial time on graphs with excluded minors
• Characterizations of derived graphs
• Elements of finite model theory.
• The strong perfect graph theorem
• The structure of claw-free graphs
• Languages that Capture Complexity Classes
• Title not available (Why is that?)
• An optimal lower bound on the number of variables for graph identification
• Almost Everywhere Equivalence of Logics in Finite Model Theory
• On logics with two variables
• Title not available (Why is that?)
• Finite model theory and its applications.
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Title not available (Why is that?)
• Sequential abstract-state machines capture sequential algorithms
• On highly closed cellular algebras and highly closed isomorphisms
• A restricted second order logic for finite structures
• Canonization for two variables and puzzles on the square
• Title not available (Why is that?)
• Title not available (Why is that?)
• Relational queries computable in polynomial time
• Definability hierarchies of generalized quantifiers
• The expressive power of finitely many generalized quantifiers
• Generalized Quantifiers and Logical Reducibilities
• Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus
• Structure and complexity of relational queries
• Expressive equivalence of least and inflationary fixed-point logic
• On a new high dimensional Weisfeiler-Lehman algorithm
• Procedural languages for database queries and updates
• From Invariants to Canonization in Parallel
• Testing Graph Isomorphism in Parallel by Playing a Game
• Choiceless polynomial time
• On polynomial time computation over unordered structures
• An extension of fixpoint logic with a symmetry-based choice construct
• Title not available (Why is that?)
• Planar Graphs: Logical Complexity and Parallel Isomorphism Tests
• Computer Science Logic

Cited In (3)

• On fixed-point logic with counting
• Strong simulation
• Fixed-Point Definability and Polynomial Time

This page was built for publication: Fixed-point definability and polynomial time on chordal graphs and line graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586010)