A note on a theorem of Blum, Shub, and Smale
From MaRDI portal
Publication:909656
DOI10.1016/0885-064X(90)90004-WzbMath0695.03020WikidataQ66459662 ScholiaQ66459662MaRDI QIDQ909656
Publication date: 1990
Published in: Journal of Complexity (Search for Journal in Brave)
computations over the real numbersNP-completeness over \({\mathbb{R}}\)polynomial-time solvability of the k-Feasibility-Problem for k\(\leq 3\)
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (4)
Computational complexity over the \(p\)-adic numbers ⋮ Computations over \(\mathbb{Z}\) and \(\mathbb{R}\): a comparison ⋮ Fixed points, Nash equilibria, and the existential theory of the reals ⋮ Real computations with fake numbers
Cites Work
This page was built for publication: A note on a theorem of Blum, Shub, and Smale
