Probabilistic model counting with short XORs

DOI10.1007/978-3-319-66263-3_1zbMath1496.68253arXiv1707.09467OpenAlexW2741834960MaRDI QIDQ1680238

Panos Theodoropoulos, Demetrios Achlioptas

Publication date: 15 November 2017

Full work available at URL: https://arxiv.org/abs/1707.09467

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Computational aspects of satisfiability (68R07)

Related Items (2)

Projected model counting: beyond independent support ⋮ Definability for model counting

This page was built for publication: Probabilistic model counting with short XORs