Document Open Access Logo

The Hardness of Decision Tree Complexity

Authors Bruno Loff , Alexey Milovanov

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.STACS.2025.66.pdf
  • Filesize: 0.67 MB
  • 13 pages
HTML5 Logo HTML (experimental)
LIPIcs.STACS.2025.66.html

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation
Keywords
  • Decision tree
  • Log-depth circuits

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Let f be a Boolean function given as either a truth table or a circuit. How difficult is it to find the decision tree complexity, also known as deterministic query complexity, of f in both cases? We prove that this problem is NC¹-hard and PSPACE-hard, respectively. The second bound is tight, and the first bound is close to being tight.

Cite As Get BibTex

Bruno Loff and Alexey Milovanov. The Hardness of Decision Tree Complexity. In 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 327, pp. 66:1-66:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.STACS.2025.66

Author Details

Bruno Loff
  • LASIGE, Faculdade de Ciências, Universidade de Lisboa, Portugal
Alexey Milovanov
  • LASIGE, Faculdade de Ciências, Universidade de Lisboa, Portugal

Funding

This work was funded by the European Union (ERC, HOFGA, 101041696). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council. Neither the European Union nor the granting authority can be held responsible for them. It was also supported by FCT through the LASIGE Research Unit, ref. UIDB/00408/2025 and ref. UIDP/00408/2025, and by CMAFcIO, FCT Project UIDB/04561/2020, https://doi.org/10.54499/UIDB/04561/2020.

Acknowledgements

The authors would like to thank Wei Zhan for his answer at StackOverflow.

References

  1. Scott Aaronson. Algorithms for boolean function query properties. SIAM Journal on Computing, 32(5):1140-1157, 2003. URL: https://doi.org/10.1137/S0097539700379644.
  2. David A Barrington. Bounded-width polynomial-size branching programs recognize exactly those languages in NC¹. In Proceedings STOC, 1986. URL: https://doi.org/10.1145/12130.12131.
  3. David A Mix Barrington, Neil Immerman, and Howard Straubing. On uniformity within NC1. Journal of Computer and System Sciences, 41(3):274-306, 1990. URL: https://doi.org/10.1016/0022-0000(90)90022-D.
  4. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Chapman and Hall/CRC, 1984. Google Scholar
  5. Arkadev Chattopadhyay, Michal Kouckỳ, Bruno Loff, and Sagnik Mukhopadhyay. Simulation theorems via pseudo-random properties. Computational Complexity, 28:617-659, 2019. URL: https://doi.org/10.1007/S00037-019-00190-7.
  6. Mika Göös. Lower bounds for clique vs. independent set. In Proceedings of FOCS, 2015. URL: https://doi.org/10.1109/FOCS.2015.69.
  7. Mika Göös, Toniann Pitassi, and Thomas Watson. Deterministic communication vs. partition number. In Proceedings of the 56th FOCS, 2015. URL: https://doi.org/10.1109/FOCS.2015.70.
  8. David Guijarro, Vıctor Lavın, and Vijay Raghavan. Exact learning when irrelevant variables abound. Information Processing Letters, 70(5):233-239, 1999. URL: https://doi.org/10.1016/S0020-0190(99)00063-0.
  9. G. V. Kass. An exploratory technique for investigating large quantities of categorical data. Applied Statistics, 29(2):119-127, 1980. Google Scholar
  10. C. Koch, C. Strassle, and L. Tan. Properly learning decision trees with queries is NP-hard. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pages 2383-2407, Los Alamitos, CA, USA, November 2023. IEEE Computer Society. URL: https://doi.org/10.1109/FOCS57990.2023.00146.
  11. Kasper Green Larsen. Models and techniques for proving data structure lower bounds. PhD thesis, Aarhus University, 2013. Google Scholar
  12. Bruno Loff and Sagnik Mukhopadhyay. Lifting theorems for equality. In Proceedings of STACS, 2019. URL: https://doi.org/10.4230/LIPIcs.STACS.2019.50.
  13. Mihai Pǎtraşcu. Lower bound techniques for data structures. PhD thesis, Massachusetts Institute of Technology, 2008. Google Scholar
  14. J. R. Quinlan. Induction of decision trees. Machine Learning, 1(1):81-106, 1986. URL: https://doi.org/10.1023/A:1022643204877.
  15. J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, 1993. Google Scholar
  16. Ran Raz and Pierre McKenzie. Separation of the monotone NC hierarchy. Combinatorica, 19(3):403-435, 1999. URL: https://doi.org/10.1007/S004930050062.
  17. Omer Reingold, Luca Trevisan, and Salil Vadhan. Notions of reducibility between cryptographic primitives. In Theory of Cryptography Conference, pages 1-20. Springer, 2004. URL: https://doi.org/10.1007/978-3-540-24638-1_1.
  18. Detlef Sieling. Minimization of decision trees is hard to approximate. J. Comput. Syst. Sci., 74(3):394-403, 2008. URL: https://doi.org/10.1016/J.JCSS.2007.06.014.
  19. Shihao Xuanyuan, Shiang Xuanyuan, and Ye Yue. Application of c4. 5 algorithm in insurance and financial services using data mining methods. Mobile Information Systems, 2022(1), 2022. Google Scholar
  20. Andrew Chi-Chih Yao. On the complexity of comparison problems using linear functions. In 16th Annual Symposium on Foundations of Computer Science (sfcs 1975), pages 85-89. IEEE Computer Society, 1975. Google Scholar
  21. Wei Zhan. URL: https://cstheory.stackexchange.com/questions/52546/a-question-about-decision-tree-complexity.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact