DECIDING FRATTINI IS NP-COMPLETE

被引：4
|
作者：
RYTER, CH [1 ]
SCHMID, J [1 ]
机构：
[1] UNIV BERN,DEPT MATH,CH-3012 BERN,SWITZERLAND
来源：
ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS | 1994年 / 11卷 / 03期
关键词：
PARTIALLY ORDERED SET; FRATTINI SUBLATTICE; NP-COMPLETE;
D O I：
10.1007/BF02115815
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We show that it is a NP-complete problem to decide whether a finite poset arises as the (Birkhoff) dual of the Frattini sublattice of some finite distributive lattice.
引用
收藏
页码：257 / 279
页数：23
相关论文
共 50 条
  • [41] System BV is NP-complete
    Kahramanogullari, Ozan
    ANNALS OF PURE AND APPLIED LOGIC, 2008, 152 (1-3) : 107 - 121
  • [42] The STO problem is NP-complete
    Krysta, P
    Pacholski, L
    JOURNAL OF SYMBOLIC COMPUTATION, 1999, 27 (02) : 207 - 219
  • [43] TENSOR RANK IS NP-COMPLETE
    HASTAD, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 372 : 451 - 460
  • [44] Decidability of NP-Complete Problems
    Vagis, A. A.
    Gupal, A. M.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2022, 58 (06) : 914 - 916
  • [45] Lambek calculus is NP-complete
    Pentus, Mati
    THEORETICAL COMPUTER SCIENCE, 2006, 357 (1-3) : 186 - 201
  • [46] Hamiltonian index is NP-complete
    Ryjacek, Zdenek
    Woeginger, Gerhard J.
    Xiong, Liming
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (04) : 246 - 250
  • [47] An NP-complete fragment of LTL
    Muscholl, A
    Walukiewicz, I
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2005, 16 (04) : 743 - 753
  • [48] Autoreducibility of NP-Complete Sets
    Hitchcock, John M.
    Shafei, Hadi
    33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
  • [49] Elastic image matching is NP-complete
    Keysers, D
    Unger, W
    PATTERN RECOGNITION LETTERS, 2003, 24 (1-3) : 445 - 453
  • [50] Theory-contraction is NP-complete
    Tennant, Neil
    LOGIC JOURNAL OF THE IGPL, 2003, 11 (06) : 675 - 693
12345