Hardness of monadic second-order formulae over succinct graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2023

Hardness of monadic second-order formulae over succinct graphs

Abstract

Our main result is a succinct counterpoint to Courcelle's meta-theorem as follows: every arborescent monadic second-order (MSO) property is either NP-hard or coNP-hard over graphs given by succinct representations. Succint representations are Boolean circuits computing the adjacency relation. Arborescent properties are those which have infinitely many models and countermodels with bounded treewidth. We actually prove this result in the terminology of automata network, which is a generalization of finite cellular automata over arbitrary graphs. This model arose from the biological modelization of neural networks and gene regulation networks. Our result states that every arborescent MSO property on the transition graph of automata networks is either NP-hard or coNP-hard. Moreover, we explore what happens when the arborescence condition is dropped and show that, under a reasonable complexity assumption, the previous dichotomy fails, even for questions expressible in first-order logic.
Fichier principal
Vignette du fichier
ricean-mso-nd.pdf (259.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03978957 , version 1 (08-02-2023)

Licence

Attribution

Identifiers

Cite

Guilhem Gamard, Pierre Guillon, Kévin Perrot, Guillaume Theyssier. Hardness of monadic second-order formulae over succinct graphs. 2023. ⟨hal-03978957⟩
66 View
22 Download

Altmetric

Share

Gmail Facebook X LinkedIn More