Computing Algebraic Formulas Using a Constant Number of Registers
- 1 February 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 21 (1), 54-58
- https://doi.org/10.1137/0221006
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Bounded-width polynomial-size branching programs recognize exactly those languages in NC1Journal of Computer and System Sciences, 1989
- Bounds for Width Two Branching ProgramsSIAM Journal on Computing, 1986
- Completeness classes in algebraPublished by Association for Computing Machinery (ACM) ,1979
- Generators for Certain Alternating Groups with Applications to CryptographySIAM Journal on Applied Mathematics, 1975
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974