Relative complexity of algebras
- 1 December 1981
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 14 (1) , 193-214
- https://doi.org/10.1007/bf01752396
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- The Role of Modern Algebra in ComputingPublished by Springer Nature ,1987
- Rational algebraic theories and fixed-point solutionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1976
- Abstract Data Types and Software ValidationPublished by Defense Technical Information Center (DTIC) ,1976
- Specification techniques for data abstractionsIEEE Transactions on Software Engineering, 1975
- The algebraic theory of recursive program schemesPublished by Springer Nature ,1975
- Comparison of polynomial-time reducibilitiesPublished by Association for Computing Machinery (ACM) ,1974
- Correctness of Translations of Programming Languages -- An Algebraic ApproachPublished by Defense Technical Information Center (DTIC) ,1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- An algebraic description of programs with assertions, verification and simulationACM SIGPLAN Notices, 1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971