Proving lower bounds for linear decision trees

  • Marc Snir
Session 9: K. Mehlhorn, Chairman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 115)


Decision Tree Invariance Principle Strong Inequality Linear Decision Adversary Argument 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    M. Friedman and B. Weide, On the complexity of computing the measure of ∪[ai,bi], Comm. ACM 21 (1978), 540–544.Google Scholar
  2. 2.
    F. Fussenegger and H. Gabow, Using comparison trees to derive lower bounds for selection problems, Proceedings IEEE Ann. Symp. on Foundations of Computer Science (1976), 178–182.Google Scholar
  3. 3.
    B. Grunbaum, Convex Polytopes, Wiley, London, 1967.Google Scholar
  4. 4.
    J. C. Holladay, Cartesian products of termination games, in: M. Dresher, A. W. Tucker, P. Wolfe (Eds.), Contributions to the Theory of Games, Vol. 3, Annals of Math. Studies No. 39, Princeton University Press, Princeton, N. J., 1957, 189–199.Google Scholar
  5. 5.
    D. E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, Mass., 1973.Google Scholar
  6. 6.
    H. T. Kung, F. L. Luccio and F. P. Preparata, On finding the maxima of a set of vectors, J. ACM 22 (1975), 469–476.Google Scholar
  7. 7.
    W. J. Paul, Realizing Boolean functions on disjoint sets of variables, Th. Comp. Sci. 2 (1976), 383–396.Google Scholar
  8. 8.
    M. O. Rabin, Proving simultaneous positivity of linear forms, J. Comput. Sys. Sci. 6 (1972), 639–650.Google Scholar
  9. 9.
    M. O. Rabin, Private communication.Google Scholar
  10. 10.
    E. M. Reingold, Computing the maxima and the median, Proc. IEEE 12th Ann. Symp. on Switching and Automata Theory (1971), 216–218.Google Scholar
  11. 11.
    M. Snir, Comparisons between linear forms can help, Tech. Rep. CSR-60-80, Comp. Sci. Dept., Univ. of Edinburgh, 1980. Also to be published in Th. Comp. Sci. Google Scholar
  12. 12.
    A. C. Yao, On the complexity of comparison problems using linear functions, Proc. IEEE 16th. Ann. Symp. on Foundations of Computer Science (1975), 85–89.Google Scholar
  13. 13.
    A. C. Yao and R. Rivest, On the polyhedral decision problem, SIAM J. Comput. 9 (1980), 343–347.Google Scholar
  14. 14.
    C. K. Yap, On lifted problems, Proc. IEEE 19th Ann. Symp. on Foundations of Computer Science (1978), 267–279.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Marc Snir
    • 1
  1. 1.Department of Computer Science Courant Institute of Mathematical SciencesNew York UniversityNew York

Personalised recommendations