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. Electronic Colloquium on Computational Complexity (ECCC), 2(57), 1995. [doi]

@article{ECCC-TR95-057,
  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 = {1995},
  url = {http://eccc.hpi-web.de/eccc-reports/1995/TR95-057/index.html},
  tags = { algebra},
  researchr = {https://researchr.org/publication/ECCC-TR95-057},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {2},
  number = {57},
}