scientific article; zbMATH DE number 7204563
From MaRDI portal
Publication:5111443
DOI10.4230/LIPICS.ICALP.2017.111zbMATH Open1442.68052arXiv1702.05589MaRDI QIDQ5111443FDOQ5111443
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
Title of this publication is not available (Why is that?)
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
Combinatorics in computer science (68R05) Database theory (68P15) Logic in computer science (03B70) Networks and circuits as models of computation; circuit complexity (68Q06)
Cited In (11)
- Enumerating models of DNF faster: breaking the dependency on the formula size
- Fast, flexible MUS enumeration
- Title not available (Why is that?)
- An efficient counting network
- Title not available (Why is that?)
- Fast and Efficient Circuit Topologies forFinding the Maximum of n k-Bit Numbers
- Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
- An Experimental Study of the Treewidth of Real-World Graph Data
- A counting algorithm for a cyclic binary query
- Connecting knowledge compilation classes and width parameters
- Title not available (Why is that?)
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)
