scientific article; zbMATH DE number 1263209
From MaRDI portal
Publication:4234080
zbMath0938.68648MaRDI QIDQ4234080
Thomas Lickteig, Felipe Cucker, Kai Werther, Pascal Koiran, Marek Karpinski
Publication date: 29 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
Elimination of constants from machines over algebraically closed fields ⋮ Straight-line programs in geometric elimination theory ⋮ On the computation of Boolean functions by analog circuits of bounded fan-in ⋮ Kolmogorov Complexity Theory over the Reals ⋮ Coin Flipping Cannot Shorten Arithmetic Computations ⋮ Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets ⋮ A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density ⋮ Elimination of parameters in the polynomial hierarchy ⋮ Some speed-ups and speed limits for real algebraic geometry ⋮ Real computations with fake numbers ⋮ The PCP theorem for NP over the reals
This page was built for publication: