Lower bounds for some decision problems over C

Abstract

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… (More)
DOI: 10.1016/S0304-3975(01)00273-0

Topics

Cite this paper

@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} }