Zero-One Designs Produce Small Hard SAT Instances

DOI10.1007/978-3-642-14186-7_37zbMath1306.68177OpenAlexW2129596464MaRDI QIDQ4931562

I. T. A. Spence, Allen van Gelder

Publication date: 29 September 2010

Published in: Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14186-7_37

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of block designs (05B05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results ⋮ MaxSAT Resolution and Subcube Sums

Uses Software

• tts

This page was built for publication: Zero-One Designs Produce Small Hard SAT Instances