%0 Journal Article %1 keyhere %A Kuznetsov, Sergei %A Obiedkov, Sergei %D 2006 %J Formal Concept Analysis %K #P complexity fca pseudo-intent theory %P 306--308 %T Counting Pseudo-intents and #P-completeness %U http://dx.doi.org/10.1007/11671404_21 %X 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 Turingequivalent to a #P-complete problem.