A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations
From MaRDI portal
Publication:5215456
DOI10.1145/3321479zbMath1473.68092arXiv1803.03600OpenAlexW3102789953MaRDI QIDQ5215456
Gregorio Malajovich, Michael Shub
Publication date: 11 February 2020
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.03600
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other nonclassical models of computation (68Q09)
This page was built for publication: A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations