The following pages link to (Q4234080):
Displaying 11 items.
- On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
- Elimination of parameters in the polynomial hierarchy (Q1285590) (← links)
- Elimination of constants from machines over algebraically closed fields (Q1361877) (← links)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- Some speed-ups and speed limits for real algebraic geometry (Q1594829) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density (Q2052162) (← links)
- The PCP theorem for NP over the reals (Q2355329) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- Kolmogorov Complexity Theory over the Reals (Q4918012) (← links)
- Coin Flipping Cannot Shorten Arithmetic Computations (Q5742361) (← links)
