An exponential lower bound on the size of algebraic decision trees for Max

Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao. An exponential lower bound on the size of algebraic decision trees for Max. Computational Complexity, 7(3):193-203, 1998. [doi]

@article{GrigorievKY98,
  title = {An exponential lower bound on the size of algebraic decision trees for Max},
  author = {Dima Grigoriev and Marek Karpinski and Andrew Chi-Chih Yao},
  year = {1998},
  url = {http://link.springer.de/link/service/journals/00037/bibs/8007003/80070193.htm},
  tags = { algebra},
  researchr = {https://researchr.org/publication/GrigorievKY98},
  cites = {0},
  citedby = {0},
  journal = {Computational Complexity},
  volume = {7},
  number = {3},
  pages = {193-203},
}