Lower bounds for linear degeneracy testing

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 554-560

  Ailon, Nir ^a   Chazelle, Bernard ^a  

^a Princeton University   (United States)

Author keywords

Computational Geometry; Linear Decision Trees; Lower Bounds

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; POLYNOMIALS; PROBLEM SOLVING; TENSORS; THEOREM PROVING;

GEOMETRIZATION; LINEAR DECISION TREES; LOWER BOUNDS;

COMPUTATIONAL GEOMETRY;

EID: 4544307664     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007436     Document Type: Conference Paper

References (24)

1. Arkin, E.M., Chiang, Y.-J., Held, M., Mitchell, J.S.B., Sacristan, V., Skiena, S.S., Yang, T.-C. On minimum-area hulls, Algorithmica 21 (1998), 119-136.
2. Barequet, G., Har-Peled, S. Polygon containment and translational min-Hausdorff-distance between segment sets are 3SUM-hard, Int. J. Comput. Geom. and App. 11 (2001), 465-474.
3. 2log n) algorithm is sometimes hard, Proc. 8th Canad. Conf. Comput. Geom., Ottawa, Ontario, Canada, Aug. 1996, 289-294.
4. Ben-Or, M. Lower bounds for algebraic computation trees, Proc. 15th Annual ACM Sympos. Theory Comput. (1983), 80-86.
5. Björner, A., Lovász, L., Yao, A.C. Linear decision trees: volume estimates and topological bounds, Proc. 24th Annual ACM Symp. Theory Comput. (1992), 170-177.
6. Bose, P., van Kreveld, M., and Toussaint, G. Filling polyhedral molds, Proc. 3rd Workshop Algorithms Data Structures, LNCS, Springer-Verlag 709 (1993), 210-221.
7. de Berg, M., de Groot, M., Overmars, M. Perfect binary space partitions, Comput. Geom. Theory Appl. 7 (1997), 81-91.
8. Dietzfelbinger, M. Lower bounds for sorting of sums, Theoret. Comput. Sci. 66 (1989), 137-155.
9. Dobkin, D.P., Lipton, R.J. On the complexity of computations under varying set of primitives, Journal of Computer and Systems Science 18 (1979), 86-91.
10. Erickson J. Lower bounds for linear satisfiability problems, Chicago Journal of Theoretical Computer Science 8, 1999.
11. Erickson J. New lower bounds for convex hull problems in odd dimensions, SIAM J. Comput. 28 (1999), 1198-1214.
12. Erickson J., Seidel, R. Better lower bounds on detecting affine and spherical degeneracies, Disc. Comput. Geom. 13 (1995) 41-57.
13. Fredman, M.L. How good is the information theory bound in sorting, Theoret. Comput. Sci. 1 (1976), 355-361.
14. 2) problems in computational geometry, Comput. Geom. Theory Appl. 5 (1995), 165-185.
15. Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., Smolensky, R. A lower bound for randomized algebraic decision trees, Proc. 28th Annual ACM Symp. Theory Comput. (1996), 612-619.
16. Grigoriev, D., Karpinski, M., Vorobjov, N. Lower bound on testing membership to a polyhedron by algebraic decision and computation trees, Discrete Comput. Geom. 17 (1997), 191-215.
17. MacWillams, F.J., Sloane, N.J.A. The Theory of Error Correcting Codes, North Holland, 1977.
18. Matousek, J. On geometric optimization with few violated constraints, Disc. Comput. Geom. 14 (1995), 365-384.
19. Meyer auf der Heide, F. A polynomial linear search algorithm for the n-dimensional knapsack problem, J. ACM 31 (1984), 668-676.
20. Nagura, J. On the interval containing at least one prime number, Proc. Japan Acad. 28 (1952), 177-181.
21. Steele, M., Yao, A.C. Lower bounds for algebraic decision trees, Journal of Algorithms 3 (1982), 1-8.
22. Yao, A.C. Decision tree complexity and Betti numbers, J. Comput. System Sci. 55 (1997), 36-43.
23. Yao, A.C. Algebraic decision trees and Euler characteristics, Theoret. Comput. Sci. 141 (1995), 133-150.
24. Yao, A.C. DIMACS Workshop on Intrinsic Complexity of Computation, April 10-13, 2000.