Research map / Learning theory and algorithms / Combinatorial and search optimization
On the Hardness of Probabilistic Inference Relaxations
Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- On the Hardness of Approximating Distributions with Tractable Probabilistic Models (NeurIPS 2025 · similarity 0.88)
- An Approximate Skolem Function Counter (AAAI 2024 · similarity 0.88)
- Towards Real-Time Approximate Counting (AAAI 2025 · similarity 0.88)
- Auditable Algorithms for Approximate Model Counting (AAAI 2024 · similarity 0.86)
- Model Counting and Sampling via Semiring Extensions (AAAI 2024 · similarity 0.85)
- Towards Projected and Incremental Pseudo-Boolean Model Counting (AAAI 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
