Author of the publication

The Implication Logic of (n, k)-Extremal Lattices.

. ICFCA, volume 10308 of Lecture Notes in Computer Science, page 39-55. Springer, (2017)

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

New upper bound for the number of maximal bicliques of a bipartite graph., and . CTW, page 40-43. (2011)Upper Bound for the Number of Concepts of Contranominal-Scale Free Contexts.. ICFCA, volume 8478 of Lecture Notes in Computer Science, page 44-53. Springer, (2014)Why Concept Lattices Are Large - Extremal Theory for the Number of Minimal Generators and Formal Concepts., and . CLA, volume 1466 of CEUR Workshop Proceedings, page 73-86. CEUR-WS.org, (2015)A convexity upper bound for the number of maximal bicliques of a bipartite graph., and . Discret. Appl. Math., (2014)The Implication Logic of (n, k)-Extremal Lattices.. ICFCA, volume 10308 of Lecture Notes in Computer Science, page 39-55. Springer, (2017)Why concept lattices are large: extremal theory for generators, concepts, and VC-dimension., and . Int. J. General Systems, 46 (5): 440-457 (2017)