Sound probabilistic \#SAT with projection

DOI10.4204/EPTCS.227.2MaRDI QIDQ7021661zbMATH OpenFDO

Authors Vladimir Klebanov, Alexander Weigl, Jörg Weisbarth

Publication date 26 February 2025

Full work available at URL https://doi.org/10.4204/EPTCS.227.2

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• Chernoff–Hoeffding Bounds for Applications with Limited Independence
• Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
• Monte-Carlo approximation algorithms for enumeration problems
• New hash functions and their use in authentication and set equality
• Precise quantitative information flow analysis -- a symbolic approach
• Principles and practice of constraint programming. 19th international conference, CP 2013, Uppsala, Sweden, September 16--20, 2013. Proceedings
• Recent developments in quantitative information flow (invited tutorial)
• SampleSearch: importance sampling in presence of determinism
• Stochastic enumeration method for counting NP-hard problems
• Theory and Applications of Satisfiability Testing

This page was built for publication: Sound probabilistic \#SAT with projection

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