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 条
  • [1] Quantum advantage in deciding NP-complete problems
    Nagy, Marius
    Nagy, Naya
    QUANTUM INFORMATION PROCESSING, 2023, 22 (03)
  • [2] Quantum advantage in deciding NP-complete problems
    Marius Nagy
    Naya Nagy
    Quantum Information Processing, 22
  • [3] Deciding whether a grid is a topological subgraph of a planar graph is NP-complete
    Jimenez, Andrea
    Schmidt, Tina Janne
    DISCRETE MATHEMATICS, 2020, 343 (09)
  • [4] DECIDING WHETHER A PLANAR GRAPH HAS A CUBIC SUBGRAPH IS NP-COMPLETE
    STEWART, IA
    DISCRETE MATHEMATICS, 1994, 126 (1-3) : 349 - 357
  • [5] Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete
    Jimenez, Andrea
    Schmidt, Tina Janne
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2019, 346 : 545 - 556
  • [6] Hashiwokakero is NP-complete
    Andersson, Daniel
    INFORMATION PROCESSING LETTERS, 2009, 109 (19) : 1145 - 1146
  • [7] Minesweeper is NP-complete
    Richard Kaye
    The Mathematical Intelligencer, 2000, 22 : 9 - 15
  • [8] Shellability is NP-complete
    Goaoc, Xavier
    Patak, Pavel
    Patakova, Zuzana
    Tancer, Martin
    Wagner, Uli
    JOURNAL OF THE ACM, 2019, 66 (03)
  • [9] Rikudo is NP-complete
    Viet-Ha Nguyen
    Perrot, Kevin
    THEORETICAL COMPUTER SCIENCE, 2022, 910 : 34 - 47
  • [10] Minesweeper is NP-complete
    Kaye, R
    MATHEMATICAL INTELLIGENCER, 2000, 22 (02): : 9 - 15
12345