Generating 'Random' 3-SAT Instances with Specific Solution Space Structure
Abstract
Generating good benchmarks is important for the evaluation and improvement of any algorithm for NP-hard problems such as the Boolean satisfiability (SAT) problem. Carefully designed benchmarks are also helpful in the study of the nature
Cite
Text
Pari et al. "Generating 'Random' 3-SAT Instances with Specific Solution Space Structure." AAAI Conference on Artificial Intelligence, 2004.Markdown
[Pari et al. "Generating 'Random' 3-SAT Instances with Specific Solution Space Structure." AAAI Conference on Artificial Intelligence, 2004.](https://mlanthology.org/aaai/2004/pari2004aaai-generating/)BibTeX
@inproceedings{pari2004aaai-generating,
title = {{Generating 'Random' 3-SAT Instances with Specific Solution Space Structure}},
author = {Pari, Pushkin R. and Lin, Jane and Yuan, Lin and Qu, Gang},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2004},
pages = {960-961},
url = {https://mlanthology.org/aaai/2004/pari2004aaai-generating/}
}