Hardness of monadic second-order formulae over succinct graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gamard, Guilhem, Goubault-Larrecq, Aliénor, Guillon, Pierre, Ohlmann, Pierre, Perrot, Kévin, Theyssier, Guillaume
Format:	Preprint
Published:	2023
Subjects:	Computational Complexity Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2302.04522