PrecoSAT
From MaRDI portal
Software:19848
swMATH7832MaRDI QIDQ19848FDOQ19848
Author name not available (Why is that?)
Cited In (21)
- A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Automatically comparing memory consistency models
- Efficient all-UIP learned clause minimization
- Solving SAT in a distributed cloud: a portfolio approach
- An expressive model for instance decomposition based parallel SAT solvers
- Soundness of inprocessing in clause sharing SAT solvers
- Partitioning SAT instances for distributed solving
- On the complexity of reconstructing chemical reaction networks
- SAT solving for termination proofs with recursive path orders and dependency pairs
- Efficient CNF simplification based on binary implication graphs
- Finding efficient circuits for ensemble computation
- SAT-based preprocessing for MaxSAT
- A New Look at BDDs for Pseudo-Boolean Constraints
- An overview of parallel SAT solving
- Clause vivification by unit propagation in CDCL SAT solvers
- DPLL+ROBDD derivation applied to inversion of some cryptographic functions
- Automatic construction of parallel portfolios via algorithm configuration
- Cardinality networks: a theoretical and empirical study
- Learning rate based branching heuristic for SAT solvers
- The \textsc{MergeSat} solver
This page was built for software: PrecoSAT
