A lower bound for randomized algebraic decision trees

Computational Complexity

Volumn 6, Issue 4, 1996, Pages 357-375

  Grigoriev, Dima ^a   Karpinski, Marek ^c   Meyer Auf Der Heide, Friedhelm ^b   Smolensky, Roman ^d  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF PADERBORN   (Germany)

^c UNIVERSITY OF BONN   (Germany)

^d NONE

Author keywords

Computational Complexity; Element Distinctness; Integer Programming; Knapsack; Randomized Algebraic Decision Trees

Indexed keywords

EID: 0039924780     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01270387     Document Type: Article

References (25)

1. M. BEN-OR, Lower Bounds for Algebraic Computation Trees, Proc. 15th ACM STOC (1983), pp. 80-86.
2. A with Probability 1, SIAM J.Comput. 10 (1981), pp. 96-113.
3. A. BJÖRNER, L. LOVÁSZ AND A. YAO, Linear Decision Trees: Volume Estimates and Topological Bounds, Proc. 24th ACM STOC (1992), pp. 170-177.
4. P. BÜRGISSER, M. KARPINSKI AND T. LICKTEIG, On Randomized Algebraic Test Complexity, J. of Complexity 9 (1993), pp. 231-251.
5. 2on Linear Search Programms for the Knapsack Problem, J.Compt.Syst.Sci.16 (1978), pp. 413-417.
6. H. EDELSBRUNNER, Algorithms in Computational Geometry, Springer, 1987.
7. D. GRIGORIEV AND M. KARPINSKI, Lower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Computation Trees, Technical Report TR-93-042, International Computer Science Institute, Berkeley, 1993.
8. D. GRIGORIEV AND M. KARPINSKI, Lower Bound for Randomized Linear Decision Tree Recognizing a Union of Hyperplanes in a Generic Position, Research Report No. 85114-CS, University of Bonn, 1994.
9. D. GRIGORIEV, M. KARPINSKI, F. MEYER AUF DER HEIDE AND R. SMOLENSKY, A Lower Bound for Randomized Algebraic Decision Trees, Proc. ACM STOC (1996), pp. 612-619.
10. D. GRIGORIEV, M. KARPINSKI AND N. VOROBJOV, Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees, Discrete Comput. Geom. 17 (1997), pp. 191-215.
11. D. GRIGORIEV AND N. VOROBJOV, Solving Systems of Polynomial Inequalities in Sube1xponential Time, Journal of Symbolic Comp. 5 (1988), pp. 37-64.
12. S. LANG, Algebra, Addison-Wesley, New York, 1984.
13. P. MCMULLEN AND G. SHEPHARD, Convex Polytopes and the Upper Bound Conjecture, Cambridge University Press, Cambridge (1971).
14. S. MEISER, Point Location in Arrangements of Hyperplanes, Information and Computation 106 (1993), pp. 286-303.
15. F. MEYER AUF DER HEIDE, A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem, J. ACM 31 (1984), pp. 668-676.
16. F. MEYER AUF DER HEIDE, Nondeterministic versus Probabilistic Linear Search Algorithms, Proc. IEEE FOCS (1985a), pp. 65-73.
17. F. MEYER AUF DER HEIDE, Lower Bounds for Solving Linear Diophantic Equations on Random Access Machines, J. ACM 32 (1985b), pp. 929-937.
18. F. MEYER AUF DER HEIDE, Simulating Probabilistic by Deterministic Algebraic Computation Trees, Theoretical Computer Science 41 (1985c), pp. 325-330.
19. U. MANBER AND M. TOMPA, Probabilistic, Nondeterministic and Alternating Decision Trees, J. ACM, Vol. 32 (1985),pp. 720-732.
20. M. SNIR, Lower Bounds for Probabilistic Linear Decision Trees, Theor. Comput. Sci., Vol. 38 (1985), pp. 69-82.
21. J. M. STEELE AND A. C. YAO, Lower Bounds for Algebraic Decision Trees, J. of Algorithms 3 (1982), pp. 1-8.
22. A. TARSKI, A Decision Method for Elementary Algebra and Geometry, University of California Press, 1951.
23. A. YAO, A Lower Bound to Finding Convex Hulls, J. ACM 28 (1981), pp. 780-787.
24. A. YAO, Algebraic Decision Trees and Euler Characteristics, Proc. 33rd IEEE FOCS (1992), pp. 268-277.
25. A. YAO, Decision Tree Complexity and Betti Numbers, Proc. 26th ACM STOC (1994), pp. 615-624.