Author of the publication

Approximating Concept Stability.

, and . ICFCA, volume 7278 of Lecture Notes in Computer Science, page 7-15. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On Links between Concept Lattices and Related Complexity Problems., and . ICFCA, volume 5986 of Lecture Notes in Computer Science, page 138-144. Springer, (2010)Models, Methods, and Programs for Generating Relationships from a Lattice of Closed Sets. Higher School of Economics, Moscow, (2012)Recognizing Pseudo-intents is coNP-complete., and . CLA, volume 672 of CEUR Workshop Proceedings, page 294-301. CEUR-WS.org, (2010)Enumerating Minimal Hypotheses and Dualizing Monotone Boolean Functions on Lattices., and . ICFCA, volume 6628 of Lecture Notes in Computer Science, page 42-48. Springer, (2011)Computing premises of a minimal cover of functional dependencies is intractable., and . Discret. Appl. Math., 161 (6): 742-749 (2013)Approximating Concept Stability., and . ICFCA, volume 7278 of Lecture Notes in Computer Science, page 7-15. Springer, (2012)Dualization in Lattices Given by Ordered Sets of Irreducibles., and . CoRR, (2015)Dualization in lattices given by ordered sets of irreducibles., and . Theor. Comput. Sci., (2017)