True 3-D displays for avionics and mission crewstations
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
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.
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004