External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Enumerating the Irreducible Closed Sets of an Acyclic Implicational Base of Bounded Degree

Oscar Defrain, Arthur Ohana, Simon Vilmin. Enumerating the Irreducible Closed Sets of an Acyclic Implicational Base of Bounded Degree. In Ho-Lin Chen, Wing-Kai Hon, Meng-Tsung Tsai, editors, 36th International Symposium on Algorithms and Computation, ISAAC 2025, Tainan, Taiwan, December 7-10, 2025. Volume 359 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. [doi]

Authors

Oscar Defrain

This author has not been identified. Look up 'Oscar Defrain' in Google

Arthur Ohana

This author has not been identified. Look up 'Arthur Ohana' in Google

Simon Vilmin

This author has not been identified. Look up 'Simon Vilmin' in Google
runs on