Chai Wah Wu
Linear Algebra and Its Applications
We investigate the complexity of algebraic decision trees deciding membership in a hypersurface X ⊂ Cm. 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 ⊂ Cm. Over the reals, where in addition to equality branching also ≤-branching is allowed, we prove an analogous statement for irreducible "generic" hypersurfaces X ⊂ Rm. In the case m = 1 we give also a lower bound for finite subsets X ⊂ R. © 1992.
Chai Wah Wu
Linear Algebra and Its Applications
Igor Devetak, Andreas Winter
ISIT 2003
Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998
Timothy J. Wiltshire, Joseph P. Kirk, et al.
SPIE Advanced Lithography 1998