Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden
DOI10.1613/JAIR.1.13909zbMATH Open1506.68130OpenAlexW4318453039MaRDI QIDQ5881807FDOQ5881807
Authors: Dongdong Zhao, Lei Liao, Wenjian Luo, Hao Jiang, Xiao-Yi Hu 
Publication date: 13 March 2023
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.1.13909
Recommendations
- Generating hard satisfiable formulas by hiding solutions deceptively
- A wealth of SAT distributions with planted assignments
- Generating Difficult CNF Instances in Unexplored Constrainedness Regions
- Unique solution instance generation for the 3-satisfiability (3SAT) problem
- scientific article; zbMATH DE number 956856
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cites Work
- (If) size matters: size-hiding private set intersection
- Title not available (Why is that?)
- Generating SAT instances with community structure
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Many hard examples in exact phase transitions
- Title not available (Why is that?)
- Lower bounds for random 3-SAT via differential equations
- Generating hard satisfiability problems
- Generating hard satisfiable formulas by hiding solutions deceptively
- Title not available (Why is that?)
- A model of random industrial SAT
- Popularity-similarity random SAT formulas
- Hiding the input-size in secure two-party computation
- Bounded size-hiding private set intersection
Cited In (3)
This page was built for publication: Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5881807)
