PrecoSAT
From MaRDI portal
Software:19848
swMATH7832MaRDI QIDQ19848FDOQ19848
Author name not available (Why is that?)
Cited In (21)
- Soundness of Inprocessing in Clause Sharing SAT Solvers
- A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions
- Automatically comparing memory consistency models
- Learning Rate Based Branching Heuristic for SAT Solvers
- Efficient all-UIP learned clause minimization
- Solving SAT in a distributed cloud: a portfolio approach
- On the complexity of reconstructing chemical reaction networks
- SAT solving for termination proofs with recursive path orders and dependency pairs
- A New Look at BDDs for Pseudo-Boolean Constraints
- An Expressive Model for Instance Decomposition Based Parallel SAT Solvers
- An overview of parallel SAT solving
- Finding Efficient Circuits for Ensemble Computation
- SAT-Based Preprocessing for MaxSAT
- Clause vivification by unit propagation in CDCL SAT solvers
- Efficient CNF Simplification Based on Binary Implication Graphs
- Automatic construction of parallel portfolios via algorithm configuration
- Cardinality networks: a theoretical and empirical study
- The \textsc{MergeSat} solver
- Partitioning SAT Instances for Distributed Solving
This page was built for software: PrecoSAT
