Algebraic Structures with Hard Equivalence and Minimization Problems
- 20 September 1984
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 31 (4) , 879-904
- https://doi.org/10.1145/1634.1639
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Probabilistic Algorithms for Deciding Equivalence of Straight-Line ProgramsJournal of the ACM, 1983
- On the Complexity of Flowchart and Loop Program Schemes and Programming LanguagesJournal of the ACM, 1982
- A Unified Approach to Path ProblemsJournal of the ACM, 1981
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- On the Computational Complexity of Program Scheme EquivalenceSIAM Journal on Computing, 1980
- Free modular latticesTransactions of the American Mathematical Society, 1980
- Assignment Commands with Array ReferencesJournal of the ACM, 1978
- On the equivalence, containment, and covering problems for the regular and context-free languagesJournal of Computer and System Sciences, 1976
- Regular Algebra Applied to Path-finding ProblemsIMA Journal of Applied Mathematics, 1975
- The Equivalence Problem of Simple ProgramsJournal of the ACM, 1970