scientific article; zbMATH DE number 1263209

MaRDI QIDQ4234080zbMATH OpenFDO

Authors Felipe Cucker, Thomas Lickteig, Kai Werther, Marek Karpinski, Pascal Koiran

Publication date 29 June 1999

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited in

(12)

• Elimination of parameters in the polynomial hierarchy
• Elimination of constants from machines over algebraically closed fields
• Straight-line programs in geometric elimination theory
• Some speed-ups and speed limits for real algebraic geometry
• Real computations with fake numbers
• A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density
• The PCP theorem for NP over the reals
• Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
• Kolmogorov Complexity Theory over the Reals
• Coin Flipping Cannot Shorten Arithmetic Computations
• On the computation of Boolean functions by analog circuits of bounded fan-in
• Erzeugungsgrad, VC-dimension and neural networks with rational activation function

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4234080)