scientific article; zbMATH DE number 6829393
From MaRDI portal
Publication:4601904
DOI10.4230/LIPICS.STACS.2016.52zbMATH Open1388.68129arXiv1509.05623MaRDI QIDQ4601904FDOQ4601904
Authors: Arnaud Mary, Yann Strozecki 
Publication date: 24 January 2018
Full work available at URL: https://arxiv.org/abs/1509.05623
Title of this publication is not available (Why is that?)
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
- A general framework for enumerating equivalence classes of solutions
- A general framework for enumerating equivalence classes of solutions
- Enumerating All Solutions for Constraint Satisfaction Problems
- Enumerating maximal consistent closed sets in closure systems
- scientific article; zbMATH DE number 524121
Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70)
Cited In (12)
- Enumerating models of DNF faster: breaking the dependency on the formula size
- A general framework for enumerating equivalence classes of solutions
- Incremental delay enumeration: space and time
- Title not available (Why is that?)
- Letter to the Editor—-A Closed Form Solution of Certain Programming Problems
- Generation problems
- Mathematical Foundations of Computer Science 2004
- Formal Concept Analysis
- Efficient Enumeration of Distinct Factors Using Package Representations
- Polynomial-delay enumeration algorithms in set systems
- About the enumeration algorithms of closed sets
- 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)
