Author:
Xu Yongjie,Song Fu,Chen Taolue
Publisher
Springer International Publishing
Reference48 articles.
1. Abed, S., Abdelaal, A.A., Alshayeji, M.H., Ahmad, I.: Sat-based and CP-based declarative approaches for top-rank-k closed frequent itemset mining. Int. J. Intell. Syst. 36(1), 112–151 (2021)
2. Lecture Notes in Computer Science;D Achlioptas,2018
3. Angluin, D.: On counting problems and the polynomial-time hierarchy. Theoret. Comput. Sci. 12, 161–173 (1980)
4. Bacchus, F., Dalmao, S., Pitassi, T.: Algorithms and complexity results for #SAT and Bayesian inference. In: Proceedings of the 44th Symposium on Foundations of Computer Science, 11–14 October 2003, Cambridge, MA, USA, pp. 340–351 (2003)
5. Bellare, M., Goldreich, O., Petrank, E.: Uniform generation of np-witnesses using an NP-oracle. Inf. Comput. 163(2), 510–526 (2000)