Model counting with error-correcting codes

DOI10.1007/s10601-018-9296-3zbMath1483.68242OpenAlexW2912201758WikidataQ128436436 ScholiaQ128436436MaRDI QIDQ2009186

Panos Theodoropoulos, Demetrios 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

satisfiabilityrandomized algorithmscoding theorymodel countinglow-density parity check codessystems of parity equations

Mathematics Subject Classification ID

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

Uses Software

• CryptoMiniSat
• sharpSAT

Cites Work

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

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