Counting Real Roots in Polynomial-Time via Diophantine Approximation
{{output}}
Suppose A = { a 1 , … , a n + 2 } ⊂ Z n has cardinality n + 2 , with all the coordinates of the a j having absolute value at most d, and the a j do not all lie in the same affine hyperplane. Suppose F = ( f 1 , … , f n ) is an n ... ...
