DeepAI AI Chat
Log In Sign Up

Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs

by   Berit Grußien, et al.
Humboldt-Universität zu Berlin

We show that the class of chordal claw-free graphs admits LREC=-definable canonization. LREC= is a logic that extends first-order logic with counting by an operator that allows it to formalize a limited form of recursion. This operator can be evaluated in logarithmic space. It follows that there exists a logarithmic-space canonization algorithm, and therefore a logarithmic-space isomorphism test, for the class of chordal claw-free graphs. As a further consequence, LREC= captures logarithmic space on this graph class. Since LREC= is contained in fixed-point logic with counting, we also obtain that fixed-point logic with counting captures polynomial time on the class of chordal claw-free graphs.


page 1

page 2

page 3

page 4


Capturing Polynomial Time using Modular Decomposition

The question of whether there is a logic that captures polynomial time i...

Simulating Logspace-Recursion with Logarithmic Quantifier Depth

The fixed-point logic LREC= was developed by Grohe et al. (CSL 2011) in ...

Separating Rank Logic from Polynomial Time

In the search for a logic capturing polynomial time the most promising c...

Separating LREC from LFP

LREC= is an extension of first-order logic with a logarithmic recursion ...

Reasoning about Social Choice and Games in Monadic Fixed-Point Logic

Whether it be in normal form games, or in fair allocations, or in voter ...

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting

At the core of the quest for a logic for PTime is a mismatch between alg...

Logarithmic-Bounded Second-Order Quantifiers and Limited Nondeterminism

We add logarithmic-bounded second-order quantifiers to the inflationary ...