A wealth of SAT distributions with planted assignments

DOI10.1007/B13743MaRDI QIDQ5897202zbMATH OpenOpenAlexFDO

Authors Tassos Dimitriou

Publication date 2 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13743

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• SAT distributions with planted assignments and phase transitions between decision and optimization problems
• SAT Distributions with Phase Transitions between Decision and Optimization Problems
• Generating hard satisfiable formulas by hiding solutions deceptively
• Random constraint satisfaction: easy generation of hard (satisfiable) instances
• Generating hard satisfiability problems

Cited in

(9)

• Generating instances for MAX2SAT with optimal solutions
• SAT distributions with planted assignments and phase transitions between decision and optimization problems
• Balance and filtering in structured satisfiable problems. (Preliminary report)
• Reweighted belief propagation and quiet planting for random K-SAT
• SAT Distributions with Phase Transitions between Decision and Optimization Problems
• Generating hard satisfiable formulas by hiding solutions deceptively
• Unbiased statistics of a constraint satisfaction problem - a controlled-bias generator
• Generating weighted MAX-2-SAT instances with frustrated loops: an RBM case study
• Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden

Describes a project that uses

Uses Software

• Walksat

This page was built for publication: A wealth of SAT distributions with planted assignments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897202)