On the Computational Complexity of Algebra on Lattices
- 1 February 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 16 (1) , 129-148
- https://doi.org/10.1137/0216011
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Nonlinear Algebra and Optimization on Rings are “Hard”SIAM Journal on Computing, 1987
- Algebraic Structures with Hard Equivalence and Minimization ProblemsJournal of the ACM, 1984
- FINITE LANGUAGES AND THE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC STRUCTURESPublished by Elsevier ,1983
- Free modular latticesTransactions of the American Mathematical Society, 1980
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- General Lattice TheoryPublished by Springer Nature ,1978
- Data Types as LatticesSIAM Journal on Computing, 1976
- The undecidability of the word problems for projective geometries and modular latticesTransactions of the American Mathematical Society, 1974
- Recursively unsolvable word problems of modular lattices and diagram-chasingJournal of Algebra, 1973
- Identities in finite partition latticesProceedings of the American Mathematical Society, 1961