"Hardness of monadic second-order formulae over succinct graphs."

Guilhem Gamard et al. (2023)

Details and statistics

DOI: 10.48550/ARXIV.2302.04522

access: open

type: Informal or Other Publication

metadata version: 2023-02-13

a service of  Schloss Dagstuhl - Leibniz Center for Informatics