PR ≠ NCR

This publication has 5 references indexed in Scilit:

• Some Remarks on the Foundations of Numerical Analysis
  SIAM Review, 1990
• Sur la complexité du principe de Tarski-Seidenberg
  Bulletin de la Société Mathématiques de France, 1990
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
  Bulletin of the American Mathematical Society, 1989
• Algebraic Complexity Theory
  Annual Review of Computer Science, 1988
• Computational Geometry
  Published by Springer Nature ,1985