Free lattice algorithms

DOI10.1007/BF00340775MaRDI QIDQ581431zbMATH OpenFDO

Authors Ralph Freese

Publication date 1987

Published in Order (Search for Journal in Brave)

zbMATH Keywords

implementationtime complexityefficient algorithmspolynomial time algorithmcoverfree latticeWhitman's algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Free lattices, projective lattices, word problems (06B25) Software, source code, etc. for problems pertaining to ordered structures (06-04)

Recommendations

• scientific article; zbMATH DE number 758787
• A fast algorithm for building lattices
• Finitely Presented Lattices: Canonical Forms and the Covering Relation
• scientific article; zbMATH DE number 3849292
• On the Computational Complexity of Algebra on Lattices

Cites work

• scientific article; zbMATH DE number 3906552 (Why is no real title available?)
• scientific article; zbMATH DE number 3773659 (Why is no real title available?)
• scientific article; zbMATH DE number 3777562 (Why is no real title available?)
• scientific article; zbMATH DE number 3472104 (Why is no real title available?)
• Covers in Free Lattices
• Equational Bases and Nonmodular Lattice Varieties
• Free Modular Lattices
• Free lattices
• On the Computational Complexity of Algebra on Lattices
• Projective Geometries as Projective Modular Lattices
• Projective lattices
• Splitting lattices generate all lattices
• What is Lisp

Cited in

(6)

• Symmetric embeddings of free lattices into each other
• Finitely Presented Lattices: Canonical Forms and the Covering Relation
• Computers and universal algebra: Some directions
• A visual approach to test lattices
• Jónsson's contributions to lattice theory
• Singular covers in free lattices

This page was built for publication: Free lattice algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q581431)