The following pages link to ManySAT (Q13299):
Displaying 36 items.
- SAT race 2015 (Q334795) (← links)
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic (Q478379) (← links)
- An overview of parallel SAT solving (Q487635) (← links)
- Automatic construction of parallel portfolios via algorithm configuration (Q511786) (← links)
- Revised version of block cipher CHAM (Q776328) (← links)
- A collaborative approach for multi-threaded SAT solving (Q839500) (← links)
- Machine learning-based restart policy for CDCL SAT solvers (Q1656568) (← links)
- Parallelizing SMT solving: lazy decomposition and conciliation (Q1749390) (← links)
- Cooperative parallel SAT local search with path relinking (Q2057122) (← links)
- SAT competition 2020 (Q2060693) (← links)
- Leveraging GPUs for effective clause sharing in parallel SAT solving (Q2118339) (← links)
- Scalable SAT solving in the cloud (Q2118345) (← links)
- Black-box optimization in an extended search space for SAT solving (Q2181777) (← links)
- Bose-Einstein condensation in satisfiability problems (Q2253621) (← links)
- Large-scale parallelism for constraint-based local search: the costas array case study (Q2342606) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- Community and LBD-based clause sharing policy for parallel SAT solving (Q2661331) (← links)
- Distributed cube and conquer with Paracooba (Q2661340) (← links)
- Reproducible efficient parallel SAT solving (Q2661341) (← links)
- DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions (Q3007675) (← links)
- Partitioning Search Spaces of a Randomized Search (Q3100181) (← links)
- Parallel Constraint-Based Local Search on the Cell/BE Multicore Architecture (Q3163570) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- Lazy Clause Exchange Policy for Parallel SAT Solvers (Q3192066) (← links)
- DPLL: The Core of Modern Satisfiability Solvers (Q3305326) (← links)
- Laissez-Faire Caching for Parallel #SAT Solving (Q3453209) (← links)
- HordeSat: A Massively Parallel Portfolio SAT Solver (Q3453220) (← links)
- Boosting Distributed Constraint Satisfaction (Q3524204) (← links)
- A review of literature on parallel constraint solving (Q4559826) (← links)
- Automated Testing and Debugging of SAT and QBF Solvers (Q4930578) (← links)
- Partitioning SAT Instances for Distributed Solving (Q4933318) (← links)
- ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH (Q5150716) (← links)
- ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM (Q5151087) (← links)
- Parallel MUS Extraction (Q5326458) (← links)
- Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges (Q5743603) (← links)
