TIME BOUNDED COMPUTATIONS OVER THE REALS

From MaRDI portal

Revision as of 02:41, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4029500

Jump to:navigation, search

DOI10.1142/S0218196792000244zbMath0788.68043MaRDI QIDQ4029500

Felipe Cucker, Luis Miguel Pardo, José Luis Montaña

Publication date: 28 March 1993

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

recursion semialgebraic sets computations over the reals

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Hierarchies of computability and definability (03D55)

Related Items (3)

Lower bounds for arithmetic networks. II: Sum of Betti numbers ⋮ Lower bounds for arithmetic networks ⋮ Smale’s 17th problem: Average polynomial time to compute affine and projective solutions

This page was built for publication: TIME BOUNDED COMPUTATIONS OVER THE REALS

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4029500&oldid=17745538"