Deciding Frattini is NP-complete

DOI10.1007/BF02115815zbMath0819.06010OpenAlexW2014049130MaRDI QIDQ1344247

C. H. Ryter, Juerg Schmid

Publication date: 24 August 1995

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02115815

zbMATH Keywords

NP-completenessfinite posetsFrattini sublatticeBirkhoff duals of finite distributive latticesfinitely representable posets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Structure and representation theory of distributive lattices (06D05)

Related Items (2)

COMPUTATIONAL COMPLEXITY OF GENERATORS AND NONGENERATORS IN ALGEBRA ⋮ Maximal sublattices of finite distributive lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The rank of a distributive lattice
• Remarks on Priestley duality for distributive lattices
• Frattini sublattices of distributive lattices
• On the Frattini sublattice of a finite distributive lattice
• The Frattini sublattice of a finite distributive lattice
• The Frattini sublattice of a distributive lattice
• On the Frattini sublattice of a lattice
• Frattini sublattices in varieties of lattices

This page was built for publication: Deciding Frattini is NP-complete