ML Anthology

DC-SSAT: A Divide-and-Conquer Approach to Solving Stochastic Satisfiability Problems Efficiently

Stephen M. Majercik, Byron Boots
AAAI 2005 pp. 416-422
/aaai/2005/majercik2005aaai-dc/
PDF AAAI Semantic Scholar

Cite

Text

Majercik and Boots. "DC-SSAT: A Divide-and-Conquer Approach to Solving Stochastic Satisfiability Problems Efficiently." AAAI Conference on Artificial Intelligence, 2005.

Markdown

[Majercik and Boots. "DC-SSAT: A Divide-and-Conquer Approach to Solving Stochastic Satisfiability Problems Efficiently." AAAI Conference on Artificial Intelligence, 2005.](https://mlanthology.org/aaai/2005/majercik2005aaai-dc/)

BibTeX

@inproceedings{majercik2005aaai-dc,
  title     = {{DC-SSAT: A Divide-and-Conquer Approach to Solving Stochastic Satisfiability Problems Efficiently}},
  author    = {Majercik, Stephen M. and Boots, Byron},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2005},
  pages     = {416-422},
  url       = {https://mlanthology.org/aaai/2005/majercik2005aaai-dc/}
}