A problem that is easier to solve on the unit-cost algebraic RAM
- 1 December 1992
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 8 (4) , 393-397
- https://doi.org/10.1016/0885-064x(92)90003-t
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A lower bound for integer greatest common divisor computationsJournal of the ACM, 1991
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Decreasing the nesting depth of expressions involving square rootsJournal of Symbolic Computation, 1985