Enumeration classes defined by circuits

DOI10.4230/LIPICS.MFCS.2022.38MaRDI QIDQ6584035zbMATH OpenFDO

Authors Nadia Creignou, Arnaud Durand, Heribert Vollmer

Publication date 6 August 2024

zbMATH Keywords

computational complexityBoolean circuitenumeration problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Enumeration classes defined by circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584035)