Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls

Cite

Text

Chakraborty et al. "Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls." International Joint Conference on Artificial Intelligence, 2016.

Markdown

[Chakraborty et al. "Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/chakraborty2016ijcai-algorithmic/)

BibTeX

@inproceedings{chakraborty2016ijcai-algorithmic,
  title     = {{Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls}},
  author    = {Chakraborty, Supratik and Meel, Kuldeep S. and Vardi, Moshe Y.},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2016},
  pages     = {3569-3576},
  url       = {https://mlanthology.org/ijcai/2016/chakraborty2016ijcai-algorithmic/}
}