ManySAT
From MaRDI portal
Software:13299
swMATH544MaRDI QIDQ13299FDOQ13299
Author name not available (Why is that?)
Cited In (36)
- Distributed cube and conquer with Paracooba
- DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions
- Partitioning Search Spaces of a Randomized Search
- Reproducible efficient parallel SAT solving
- Automated Testing and Debugging of SAT and QBF Solvers
- Lazy Clause Exchange Policy for Parallel SAT Solvers
- Learning from conflicts in propositional satisfiability
- Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges
- Parallelizing SMT solving: lazy decomposition and conciliation
- What we can learn from conflicts in propositional satisfiability
- Community and LBD-based clause sharing policy for parallel SAT solving
- Boosting Distributed Constraint Satisfaction
- Laissez-Faire Caching for Parallel #SAT Solving
- DPLL: The Core of Modern Satisfiability Solvers
- Bose-Einstein condensation in satisfiability problems
- A review of literature on parallel constraint solving
- ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH
- Machine learning-based restart policy for CDCL SAT solvers
- Leveraging GPUs for effective clause sharing in parallel SAT solving
- HordeSat: A Massively Parallel Portfolio SAT Solver
- SAT race 2015
- Propositional SAT Solving
- Large-scale parallelism for constraint-based local search: the costas array case study
- An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic
- Parallel Constraint-Based Local Search on the Cell/BE Multicore Architecture
- Cooperative parallel SAT local search with path relinking
- An overview of parallel SAT solving
- Revised version of block cipher CHAM
- Scalable SAT solving in the cloud
- Parallel MUS Extraction
- A collaborative approach for multi-threaded SAT solving
- Black-box optimization in an extended search space for SAT solving
- Automatic construction of parallel portfolios via algorithm configuration
- Partitioning SAT Instances for Distributed Solving
- SAT competition 2020
- ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM
This page was built for software: ManySAT