scientific article; zbMATH DE number 7204563

DOI10.4230/LIPICS.ICALP.2017.111MaRDI QIDQ5111443zbMATH OpenFDO

Authors Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel

Publication date 27 May 2020

Full work available at URL https://arxiv.org/abs/1702.05589

zbMATH Keywords

enumerationcircuitsconstant delayMSO\(d\)-DNNFs

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Database theory (68P15) Logic in computer science (03B70) Networks and circuits as models of computation; circuit complexity (68Q06)

Recommendations

• Theory and Applications of Satisfiability Testing
• Efficient enumeration of cyclic permutations in situ
• scientific article; zbMATH DE number 549850
• Efficient enumeration of solutions produced by closure operations
• scientific article; zbMATH DE number 6829393
• A weighted counting algorithm for the circuit constraint
• A polyhedral model for enumeration and optimization over the set of circuits
• scientific article; zbMATH DE number 808799
• Fast and Efficient Circuit Topologies forFinding the Maximum of n k-Bit Numbers
• scientific article; zbMATH DE number 3980925

Cited in

(11)

• Enumerating models of DNF faster: breaking the dependency on the formula size
• Fast, flexible MUS enumeration
• scientific article; zbMATH DE number 5129255 (Why is no real title available?)
• An efficient counting network
• Descriptive complexity for counting complexity classes
• Fast and Efficient Circuit Topologies forFinding the Maximum of n k-Bit Numbers
• Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
• A counting algorithm for a cyclic binary query
• Enumeration on trees under relabelings
• An Experimental Study of the Treewidth of Real-World Graph Data
• Connecting knowledge compilation classes and width parameters

This page was built for publication:

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