Highly Influential

# Lower bounds for some decision problems over C

@article{Malajovich2002LowerBF, title={Lower bounds for some decision problems over C}, author={Gregorio Malajovich}, journal={Theor. Comput. Sci.}, year={2002}, volume={276}, pages={425-434} }

- Published 2002 in Theor. Comput. Sci.
DOI:10.1016/S0304-3975(01)00273-0

Lower bounds for some explicit decision problems over the complex numbers are given. The decision problems considered are certain zerodimensional subsets of N×C, and can be assimilated to a countable family of polynomials gi. More precisely, one should decide for input (i, x) if gi(x) = 0. A lower bound for deciding if a polynomial gi vanishes at some x can be derived from an uniform lower bound for the evaluation of all f ∈ (gi). That bound is obtained by means of an arithmetic invariant of… CONTINUE READING

#### From This Paper

##### Topics from this paper.

0 Citations

5 References

Similar Papers

#### References

##### Publications referenced by this paper.

Showing 1-5 of 5 references