Computations over \(\mathbb{Z}\) and \(\mathbb{R}\): a comparison

DOI10.1016/0885-064X(90)90022-6zbMath0712.12005OpenAlexW101505436MaRDI QIDQ923632

Klaus Meer

Publication date: 1990

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(90)90022-6

zbMATH Keywords

real numberscomplexity classes

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity and performance of numerical algorithms (65Y20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

On the complexity of quadratic programming in real number models of computation ⋮ Real data-integer solution problems within the Blum-Shub-Smale computational model

Cites Work

• A note on a theorem of Blum, Shub, and Smale
• Complexity of linear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computations over \(\mathbb{Z}\) and \(\mathbb{R}\): a comparison