Superpolynomial lower bounds for decision tree learning and testing

Caleb Koch, Carmen Strassle, Li-Yang Tan. Superpolynomial lower bounds for decision tree learning and testing. In Nikhil Bansal 0001, Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023. pages 1962-1994, SIAM, 2023. [doi]

@inproceedings{KochST23,
  title = {Superpolynomial lower bounds for decision tree learning and testing},
  author = {Caleb Koch and Carmen Strassle and Li-Yang Tan},
  year = {2023},
  doi = {10.1137/1.9781611977554.ch75},
  url = {https://doi.org/10.1137/1.9781611977554.ch75},
  researchr = {https://researchr.org/publication/KochST23},
  cites = {0},
  citedby = {0},
  pages = {1962-1994},
  booktitle = {Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023},
  editor = {Nikhil Bansal 0001 and Viswanath Nagarajan},
  publisher = {SIAM},
  isbn = {978-1-61197-755-4},
}