Publisher
Springer Berlin Heidelberg
Reference41 articles.
1. Aït-Kaci, H., Boyer, R., Lincoln, P., Nasr, R.: Efficient Implementation of Lattice Operations. ACM Transactions on Programming Languages and Systems 11(1), 115–146 (1989)
2. Arimura, H., Uno, T.: Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems. In: Proc. SDM, pp. 1087–1098 (2009)
3. LNAI;M.A. Babin,2011
4. Babin, M.A., Kuznetsov, S.O.: Computing Premises of a Minimal Cover of Functional Depedencies is Intractable. Discr. Appl. Math. 161, 742–749 (2013)
5. Baixeries, J., Kaytoue, M., Napoli, A.: Computing Functional Dependencies with Pattern Structures. In: Proc. 9th International Conference on Concept Lattices and Their Applications (CLA 2012), Malaga (2012)
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献