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 条

[11] BLOCKSUM is NP-Complete
Haraguchi, Kazuya
Ono, Hirotaka
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2013, E96D (03) : 481 - 488
[12] Tipover is NP-complete
Robert A. Hearn
The Mathematical Intelligencer, 2006, 28 : 10 - 14
[13] HIROIMONO is NP-Complete
Andersson, Daniel
Fun with Algorithms, Proceedings, 2007, 4475 : 30 - 39
[14] TETRAVEX is NP-complete
Takenaga, Yasuhiko
Walsh, Toby
INFORMATION PROCESSING LETTERS, 2006, 99 (05) : 171 - 174
[15] TipOver is NP-complete
Hearn, Robert A.
MATHEMATICAL INTELLIGENCER, 2006, 28 (03): : 10 - 14
[16] BoxOff is NP-Complete
Hayward, Ryan
Hearn, Robert
Jamshidian, Mahya
ADVANCES IN COMPUTER GAMES, ACG 2021, 2022, 13262 : 118 - 127
[17] Deciding whether four perfect matchings can cover the edges of a snark is NP-complete
Skoviera, Martin
Varsa, Peter
THEORETICAL COMPUTER SCIENCE, 2024, 988
[18] Contextual reasoning is NP-complete
Massacci, F
PROCEEDINGS OF THE THIRTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE, VOLS 1 AND 2, 1996, : 621 - 626
[19] Calculation Solitaire is NP-Complete
Iwamoto, Chuzo
Ide, Tatsuya
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2023, E106D (03) : 328 - 332
[20] TENSOR RANK IS NP-COMPLETE
HASTAD, J
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1990, 11 (04): : 644 - 654

← 1 2 3 4 5 →