메뉴 건너뛰기




Volumn 3874 LNAI, Issue , 2006, Pages 306-308

Counting pseudo-intents and #P-completeness

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; INFORMATION TECHNOLOGY; POLYNOMIALS; PROBLEM SOLVING;

EID: 33745538807     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11671404_21     Document Type: Conference Paper
Times cited : (26)

References (7)
  • 1
    • 33745566688 scopus 로고
    • Two basic algorithms in concept analysis
    • Preprint Nr. 831
    • B. Ganter: Two Basic Algorithms in Concept Analysis, Preprint Nr. 831, Technische Hochschule Darmstadt (1984).
    • (1984) Technische Hochschule Darmstadt
    • Ganter, B.1
  • 5
    • 0002819235 scopus 로고
    • Familles minimales d'implications informatives résultant d'un tableau de données binaires
    • J.-L. Guigues, V. Duquenne: Familles minimales d'implications informatives résultant d'un tableau de données binaires; Math. Sci. Hum. 24, 95 (1986), 5-18.
    • (1986) Math. Sci. Hum. , vol.24 , Issue.95 , pp. 5-18
    • Guigues, J.-L.1    Duquenne, V.2
  • 6
    • 23844496680 scopus 로고    scopus 로고
    • On the intractability of computing the duquenne-guigues base
    • S.O. Kuznetsov: On the Intractability of Computing the Duquenne-Guigues Base, Journal of Universal Computer Science, 10, no. 8 (2004), 927-933.
    • (2004) Journal of Universal Computer Science , vol.10 , Issue.8 , pp. 927-933
    • Kuznetsov, S.O.1
  • 7
    • 0000142982 scopus 로고
    • The complexity of enumeration and reliability problems
    • L. G. Valiant: The Complexity of Enumeration and Reliability Problems; SIAM J. Comput. 8, 3 (1979), 410-421.
    • (1979) SIAM J. Comput. , vol.8 , Issue.3 , pp. 410-421
    • Valiant, L.G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.