Selected papers that cite this one
- Felipe Cucker and Michael Shub. Generalized Knapsack problems and fixed degree separation. Theoretical Computer Science, 161(1-2):301-306, 15 July 1996. Note.
- Rudolf Fleischer. Decision trees: Old and new results. Accepted for publication in Information and Computation. Final manuscript received for publication June 29, 1998.
- Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. A lower bound for randomized algebraic decision trees. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 612-619, Philadelphia, Pennsylvania, 22-24 May 1996.
- Joos Heintz and Jacques Morgenstern. On the intrinsic complexity of elimination theory. Journal of Complexity, 9(4):471-498, December 1993.
- S. Meiser. Point location in arrangements of hyperplanes. Information and Computation, 106(2):286-303, October 1993.