Two P-complete problems in the theory of the reals
- 1 December 1992
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 8 (4) , 454-466
- https://doi.org/10.1016/0885-064x(92)90008-y
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- PR ≠ NCRJournal 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
- Algebraic Complexity TheoryAnnual Review of Computer Science, 1988
- Computational GeometryPublished by Springer Nature ,1985
- Simulation of Parallel Random Access Machines by CircuitsSIAM Journal on Computing, 1984
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976