Author:
Chakraborty Supratik,Meel Kuldeep S.,Vardi Moshe Y.
Publisher
Springer Berlin Heidelberg
Reference37 articles.
1. CryptoMiniSAT, http://www.msoos.org/cryptominisat2/
2. HotBits, http://www.fourmilab.ch/hotbits
3. Angluin, D.: On counting problems and the polynomial-time hierarchy. Theoretical Computer Science 12(2), 161–173 (1980)
4. Bacchus, F., Dalmao, S., Pitassi, T.: Algorithms and complexity results for #SAT and bayesian inference. In: Proc. of FOCS, pp. 340–351 (2004)
5. Bellare, M., Goldreich, O., Petrank, E.: Uniform generation of NP-witnesses using an NP-oracle. Information and Computation 163(2), 510–526 (1998)
Cited by
79 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献