Sgen1, a generator of small but difficult satisfiability benchmarks
From MaRDI portal
Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Recommendations
Cited in
(13)- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
- Generating hard satisfiability problems
- Satisfiability by Maxwell-Boltzmann and Bose-Einstein statistical distributions
- GenB: A General Solver for AGM Revision
- Hard satisfiable clause sets for benchmarking equivalence reasoning techniques
- GoRRiLA and Hard Reality
- tts: a SAT-solver for small, difficult instances
- Generating hard satisfiable formulas by hiding solutions deceptively
- Correct Hardware Design and Verification Methods
- Theory and Applications of Satisfiability Testing
- MaxSAT Resolution and Subcube Sums
- Generating Difficult CNF Instances in Unexplored Constrainedness Regions
- A generalized method for proving polynomial calculus degree lower bounds
This page was built for publication: Sgen1, a generator of small but difficult satisfiability benchmarks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406224)