Free lattice algorithms

DOI10.1007/BF00340775zbMath0627.06010MaRDI QIDQ581431

Ralph Freese

Publication date: 1987

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

polynomial time algorithmcovertime complexityimplementationefficient algorithmsfree 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)

Related Items (4)

Jónsson's contributions to lattice theory ⋮ Singular covers in free lattices ⋮ Computers and universal algebra: Some directions ⋮ Symmetric embeddings of free lattices into each other

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Splitting lattices generate all lattices
• Projective lattices
• Free lattices
• Projective Geometries as Projective Modular Lattices
• Covers in Free Lattices
• What is Lisp
• On the Computational Complexity of Algebra on Lattices
• Free Modular Lattices
• Equational Bases and Nonmodular Lattice Varieties

This page was built for publication: Free lattice algorithms