Computations over Z and R: A comparison
- 1 September 1990
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 6 (3) , 256-263
- https://doi.org/10.1016/0885-064x(90)90022-6
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A note on a theorem of Blum, Shub, and SmaleJournal of Complexity, 1990
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- A faster PSPACE algorithm for deciding the existential theory of the realsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Complexity of linear programmingOperations Research Letters, 1982