Relativizations of the P=?NP question over the reals (and other ordered rings)
- 1 October 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 133 (1) , 15-22
- https://doi.org/10.1016/0304-3975(94)00068-9
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
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975