A lower bound for randomized algebraic decision trees

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 612-619

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

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF BONN   (Germany)

^c UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATION THEORY; DECISION TREES; FORESTRY; GEOMETRY; ALGEBRA; DECISION THEORY; NUMBER THEORY; PROBLEM SOLVING; RANDOM PROCESSES; TOPOLOGY; TREES (MATHEMATICS);

ALGEBRAIC VARIETIES; BETTI NUMBERS; ELEMENTARY TECHNIQUES; INTERSECTIONS OF HALFSPACES; KNAPSACK PROBLEMS; LOWER BOUNDS; PROOF METHODS;

ALGEBRA; COMPUTATION THEORY;

BETTI NUMBER; DECISION TREES; KNAPSACK PROBLEM; LOWER BOUNDS;

EID: 0029717340     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.238011     Document Type: Conference Paper

References (19)

1. M. Ben-Or, Lower Bounds for Algebraic Computation Trees, Proc. 15th ACM STOC (1983), pp. 80-86.
2. A. Bjorner, L. Lovasz and A. Yao, Linear Decision Trees: Volume Estimates and Topological Bounds, Proc. 24th ACM STOC (1992), pp. 170-177.
3. P. Buergisser, M. Karpinski, T. Lickteig, On Randomized Algebraic Test Complexity, J. of Complexity 9(1993), pp. 231-251.
4. 2 on Linear Search Programms for the Knapsack Problem, J. Compt. Syst. Sci. 16(1978), pp. 413-417.
5. D. Grigoriev, 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.
6. D. Grigoriev, 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.
7. D. Grigoriev, M. Karpinski, N. Vorobjov, Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees, Proc. 36th IEEE FOCS (1995), pp. 258-265.
8. D. Grigoriev, N. Vorobjov, Solving Systems of Polynomial Inequalities in Subexponential Time, Journal of Symbolic Comp. 5(1988), pp. 37-64.
9. S. Lang, Algebra, Addison-Wesley, New York, 1965.
10. F. Meyer auf der Heide, A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem, J. ACM 31(1984), pp. 668-676.
11. F. Meyer auf der Heide, Nondeterministic versus Probabilistic Linear Search Algorithms, Proc. IEEE FOCS (1985), pp. 65-73.
12. F. Meyer auf der Heide, Lower Bounds for Solving Linear Diophantic Equations on Random Access Machines, J. ACM 32(1985), pp. 929-937.
13. F. Meyer auf der Heide, Simulating Probabilistic by Deterministic Algebraic Computation Trees, Theoretical Computer Science 41(1985), pp. 325-330.
14. U. Manber and M. Tompa, Probabilistic, Nondeterministic and Alternating Decision Trees, Proc. 14th ACM STOC (1982), pp. 234-244.
15. M. Snir, Lower Bounds for Probabilistic Linear Decision Trees, Research Report 83-6, Dept. of Computer Science, Hebrew University of Jerusalem, 1983.
16. J. M. Steele and A. C. Yao, Lower Bounds for Algebraic Decision Trees, J. of Algorithms 3(1982), pp. 1-8.
17. A. Tarski, A Decision Method for Elementary Algebra and Geometry, University of California Press, 1951.
18. A. Yao, Algebraic Decision Trees and Euler Characteristics, Proc. 33rd IEEE FOCS (1992), pp. 268-277.
19. A. Yao, Decision Tree Complexity and Betti Numbers, Proc. 26th ACM STOC (1994), pp. 615-624.