The following pages link to sharpSAT (Q28582):
Displaying 33 items.
- A finite state intersection approach to propositional satisfiability (Q442157) (← links)
- Feasibility analysis for robustness quantification by symbolic model checking (Q453480) (← links)
- Two approximate algorithms for model counting (Q507433) (← links)
- Dualization of Boolean functions using ternary decision diagrams (Q513353) (← links)
- Quantifying software reliability via model-counting (Q832053) (← links)
- Counting minimal unsatisfiable subsets (Q832272) (← links)
- Improving MCS enumeration via caching (Q1680254) (← links)
- Model counting with error-correcting codes (Q2009186) (← links)
- Not all FPRASs are equal: demystifying FPRASs for DNF-counting (Q2009190) (← links)
- Optimal symmetry breaking for graph problems (Q2009225) (← links)
- Definability for model counting (Q2303508) (← links)
- The geometry of gaussoids (Q2317379) (← links)
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures (Q2360872) (← links)
- On preprocessing techniques and their impact on propositional model counting (Q2362107) (← links)
- Taming high treewidth with abstraction, nested dynamic programming, and database technology (Q2661361) (← links)
- Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
- Lower bounds on the degree of block ciphers (Q2692355) (← links)
- Parameterized Compilation Lower Bounds for Restricted CNF-Formulas (Q2817997) (← links)
- Computing Maximum Unavoidable Subgraphs Using SAT Solvers (Q2818013) (← links)
- Sudoku Colorings of a 16-Cell Pre-fractal (Q2958110) (← links)
- Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults (Q3303928) (← links)
- Approximate Model Counting via Extension Rule (Q3452569) (← links)
- Laissez-Faire Caching for Parallel #SAT Solving (Q3453209) (← links)
- Constructing SAT Filters with a Quantum Annealer (Q3453216) (← links)
- $$\#\exists $$ SAT: Projected Model Counting (Q3453218) (← links)
- MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers (Q3454125) (← links)
- (Q5009587) (← links)
- A Study of Symmetry Breaking Predicates and Model Counting (Q5039506) (← links)
- Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability (Q5200054) (← links)
- Construction methods for gaussoids (Q5858549) (← links)
- Lifted Reasoning for Combinatorial Counting (Q5870533) (← links)
- Publication:2680775 (← links)
- Publication:5870533 (← links)
