On NP-Completeness for Linear Machines
- 1 June 1997
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 13 (2) , 259-271
- https://doi.org/10.1006/jcom.1997.0444
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On digital nondeterminismTheory of Computing Systems, 1996
- Separation of complexity classes in Koiran's weak modelTheoretical Computer Science, 1994
- Computing over the reals with addition and orderTheoretical Computer Science, 1994
- Real Number Models under Various Sets of OperationsJournal of Complexity, 1993
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989