Test complexity of generic polynomials. Bürgisser, P., Lickteig, T., & Shub, M. J. Compl., 8(3):203-215, 1992.
Test complexity of generic polynomials [link]Paper  doi  abstract   bibtex   
We investigate the complexity of algebraic decision trees deciding membership in a hypersurface $X$ in $\mathbb C^m$. We prove an optimal lower bound on the number of additions, subtractions and comparisons and an asymptotically optimal lower bound on the number of multiplications, divisions and comparisons that are needed to decide membership in a generic hypersurface $X$ in $\mathbb C^m$. Over the reals, where in addition to equality branching also $<$-branching is allowed, we prove an analoguous statement for irreducible ``generic'' hypersurfaces $X$ in $\mathbb R^m$. In the case $m=1$ we give also a lower bound for finite subsets $X$ in $\mathbb R$.
@ARTICLE{BLS-Test-Complexity-Of-Generic-Polynomials,
 URL={http://www.sciencedirect.com/science/article/pii/0885064X92900224},
 JOURNAL={J. Compl.},
 TITLE={Test complexity of generic polynomials},
 DOI={10.1016/0885-064X(92)90022-4},
 VOLUME={8},
 ABSTRACT={We investigate the complexity of algebraic decision trees deciding membership in a hypersurface $X$ in $\mathbb C^m$. We prove an optimal lower bound on the number of additions, subtractions and comparisons and an asymptotically optimal lower bound on the number of multiplications, divisions and comparisons that are needed to decide membership in a generic hypersurface $X$ in $\mathbb C^m$. Over the reals, where in addition to equality branching also $<$-branching is allowed, we prove an analoguous statement for irreducible ``generic'' hypersurfaces $X$ in $\mathbb R^m$. In the case $m=1$ we give also a lower bound for finite subsets $X$ in $\mathbb R$.},
 AUTHOR={Peter Bürgisser and Thomas Lickteig and Michael Shub},
 YEAR={1992},
 PAGES={203-215},
 NUMBER={3}
}
Downloads: 0