2 results
Martin Grohe ; Berit Grußien ; André Hernich ; Bastian Laubner.
We extend first-order logic with counting by a new operator that allows it to formalise a limited form of recursion which can be evaluated in logarithmic space. The resulting logic LREC has a data complexity in LOGSPACE, and it defines LOGSPACE-complete problems like deterministic reachability and […]
Published on March 13, 2013
Mikołaj Bojańczyk ; Martin Grohe ; Michał Pilipczuk.
We prove that for every positive integer k, there exists an MSO_1-transduction that given a graph of linear cliquewidth at most k outputs, nondeterministically, some cliquewidth decomposition of the graph of width bounded by a function of k. A direct corollary of this result is the equivalence of […]
Published on January 25, 2021