The following pages link to (Q3639756):
Displayed 27 items.
- ManySAT (Q13299) (← links)
- SAT race 2015 (Q334795) (← links)
- Symmetry in Gardens of Eden (Q396822) (← 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)
- A collaborative approach for multi-threaded SAT solving (Q839500) (← 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)
- 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)
- DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions (Q3007675) (← links)
- Propositional SAT Solving (Q3176367) (← 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)
- A review of literature on parallel constraint solving (Q4559826) (← 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)
- Finding Effective SAT Partitionings Via Black-Box Optimization (Q5153508) (← links)
- Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges (Q5743603) (← links)
- Towards better heuristics for solving bounded model checking problems (Q6080505) (← links)
- Diversifying a parallel SAT solver with Bayesian moment matching (Q6168990) (← links)