scientific article; zbMATH DE number 6829393

DOI10.4230/LIPICS.STACS.2016.52MaRDI QIDQ4601904zbMATH OpenFDO

Authors Arnaud Mary, Yann Strozecki

Publication date 24 January 2018

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

zbMATH Keywords

enumerationpolynomial delayPost's latticeset saturation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70)

Recommendations

• Efficient enumeration of solutions produced by closure operations
• Theory and Applications of Satisfiability Testing
• About the enumeration algorithms of closed sets
• Efficient computation of transitive closures
• scientific article; zbMATH DE number 1885208
• Enumerating All Solutions for Constraint Satisfaction Problems
• Enumerating maximal consistent closed sets in closure systems
• scientific article; zbMATH DE number 524121

Cited in

(11)

• Efficient Enumeration of Distinct Factors Using Package Representations
• Letter to the Editor—-A Closed Form Solution of Certain Programming Problems
• Enumerating models of DNF faster: breaking the dependency on the formula size
• Formal Concept Analysis
• Polynomial-delay enumeration algorithms in set systems
• About the enumeration algorithms of closed sets
• scientific article; zbMATH DE number 7204563 (Why is no real title available?)
• Incremental delay enumeration: space and time
• Generation problems
• Mathematical Foundations of Computer Science 2004
• Efficient enumeration of solutions produced by closure operations

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 Q4601904)