Model counting with error-correcting codes

DOI10.1007/S10601-018-9296-3MaRDI QIDQ2009186zbMATH OpenOpenAlexWikidataFDO

Authors Panos Theodoropoulos, D. Achlioptas

Publication date 27 November 2019

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10601-018-9296-3

zbMATH Keywords

coding theorylow-density parity check codesmodel countingrandomized algorithmssatisfiabilitysystems of parity equations

Mathematics Subject Classification ID

Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Decoding (94B35)

Recommendations

• Probabilistic model counting with short XORs
• Fast and flexible probabilistic model counting
• Model counting: a new stategy for obtaining good bounds
• Short XORs for Model Counting: From Theory to Practice
• Leveraging belief propagation, backtrack search, and statistics for model counting

Cites work

• Expander codes
• Model counting: a new stategy for obtaining good bounds
• Modern Coding Theory
• NP is as easy as detecting unique solutions
• On Approximation Algorithms for # P
• On computing minimal independent support and its applications to sampling and counting
• Short XORs for Model Counting: From Theory to Practice

Cited in

(3)

• Fast and flexible probabilistic model counting
• Probabilistic model counting with short XORs
• Short XORs for Model Counting: From Theory to Practice

Describes a project that uses

Uses Software

• sharpSAT
• CryptoMiniSat

This page was built for publication: Model counting with error-correcting codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009186)