Author:
Boros Endre,Gurvich Vladimir,Khachiyan Leonid,Makino Kazuhisa
Publisher
Springer Berlin Heidelberg
Reference33 articles.
1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen and A. I. Verkamo, Fast discovery of association rules, In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth and R. Uthurusamy eds., Advances in Knowledge Discovery and Data Mining, 307–328, AAAI Press, Menlo Park, California, 1996.
2. M. Anthony and N. Biggs, Computational Learning Theory, Cambridge University Press, 1992.
3. P. Bertolazzi and A. Sassano, An O(mn) time algorithm for regular set-covering problems, Theoretical Computer Science 54 (1987) 237–247.
4. J. C. Bioch and T. Ibaraki, Complexity of identification and dualization of positive Boolean functions, Information and Computation 123 (1995) 50–63.
5. E. Boros, V. Gurvich, and P.L. Hammer, Dual subimplicants of positive Boolean functions, Optimization Methods and Software, 10 (1998) 147–156.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献