On Computing the Size of a Lattice and Related Decision Problems

被引：0
|
作者：
Sergei O. Kuznetsov
机构：
[1] Technische Universität Dresden,Institut für Algebra
[2] All-Russia Institute for Scientific and Technical Information (VINITI),undefined
来源：
Order | 2001年 / 18卷
关键词：
lattices & related structures;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The problem of determining the size of a finite concept lattice is shown to be #P-complete. Since any finite lattice can be represented as a concept lattice, the problem of determining the size of a lattice given by the ordered sets of its irreducibles is also #P-complete. Some results about NP-completeness or polynomial tractability of decision problems related to concepts with bounded extent, intent, and the sum of both are given. These problems can be reformulated as decision problems about lattice elements generated by a certain amount of irreducibles.
引用
收藏
页码：313 / 321
页数：8
相关论文
共 50 条
  • [1] On computing the size of a lattice and related decision problems
    Kuznetsov, SO
    [J]. ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2001, 18 (04): : 313 - 321
  • [2] DNA computing approach to optimal decision problems
    Watada, J
    Kojima, S
    Ueda, S
    Ono, O
    [J]. 2004 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-3, PROCEEDINGS, 2004, : 1579 - 1584
  • [3] DNA computing approach to optimal decision problems
    Watada, Junzo
    Kojima, Satoshi
    Ueda, Satomi
    Ono, Osamu
    [J]. INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2006, 2 (01): : 273 - 282
  • [4] Computing Frequency Dominators and Related Problems
    Georgiadis, Loukas
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 704 - 715
  • [5] HADRON SPECTRUM - EVIDENCE FOR SIZE PROBLEMS ON THE LATTICE
    HASENFRATZ, P
    MONTVAY, I
    [J]. PHYSICAL REVIEW LETTERS, 1983, 50 (05) : 309 - 312
  • [6] LATTICE-THEORETIC DECISION PROBLEMS IN UNIVERSAL ALGEBRA
    BURRIS, SN
    SANKAPPA.HP
    [J]. NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1974, 21 (01): : A13 - A14
  • [7] Computing the Value of Information in Quadratic Stochastic Decision Problems
    Laengle, Sigifredo
    [J]. OPERATIONS RESEARCH PROCEEDINGS 2007, 2008, : 179 - 184
  • [8] Related work in multicriteria decision problems
    不详
    [J]. IEEE INTELLIGENT SYSTEMS, 2007, 22 (03) : 50 - 51
  • [9] On computing the centroid of the vertices of an arrangement and related problems
    Ajwani, Deepak
    Ray, Saurabh
    Seidel, Raimund
    Tiwary, Hans Raj
    [J]. ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2007, 4619 : 519 - +
  • [10] ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS
    Bose, Prosenjit
    Mora, Merce
    Seara, Carlos
    Sethia, Saurabh
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2011, 21 (01) : 25 - 45
12345