Complexity lower bounds for succinct binary structures of bounded clique-width with restrictions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Geniet, Colin, Goubault-Larrecq, Aliénor, Perrot, Kévin
Format:	Preprint
Published:	2026
Subjects:	Computational Complexity Discrete Mathematics 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/2602.18240