Computing over the reals with addition and order
- 1 October 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 133 (1) , 35-47
- https://doi.org/10.1016/0304-3975(93)00063-b
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Analog computation via neural networksTheoretical Computer Science, 1994
- On NC-real complexity classes for additive circuits and their relations with NCPublished by Springer Nature ,1994
- A note on a P ≠ NP result for a restricted class of real machinesJournal of Complexity, 1992
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Real addition and the polynomial hierarchyInformation Processing Letters, 1985