Abstract
Implications of a formal context (G, M, I) have a minimal implication basis, called Duquenne-Guigues basis or stem base. It is shown that the problem of deciding whether a set of attributes is a premise of the stem base is in coNP and determining the size of the stem base is polynomially Turing equivalent to a #P-complete problem. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
APA
Kuznetsov, S. O., & Obiedkov, S. (2006). Counting pseudo-intents and #P-completeness. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3874 LNAI, pp. 306–308). https://doi.org/10.1007/11671404_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free