default search action
"Hardness of monadic second-order formulae over succinct graphs."
Guilhem Gamard et al. (2023)
- Guilhem Gamard, Pierre Guillon, Kévin Perrot, Guillaume Theyssier:
Hardness of monadic second-order formulae over succinct graphs. CoRR abs/2302.04522 (2023)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.