A note on a P ≠ NP result for a restricted class of real machines
- 1 December 1992
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 8 (4) , 451-453
- https://doi.org/10.1016/0885-064x(92)90007-x
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- On the complexity of computations under varying sets of primitivesJournal of Computer and System Sciences, 1979