On Polynomial Time Constructions of Minimum Height Decision Tree

DOI10.4230/LIPIcs.ISAAC.2018.34OpenAlexW2963341726MaRDI QIDQ5091026

Waseem Makhoul, Nader H. Bshouty

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1802.00233

zbMATH Keywords

decision treeapproximation algorithmsminimal depth

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Exact learning from an honest teacher that answers membership queries

Cites Work

• Unnamed Item
• Unnamed Item
• Teachability in computational learning
• Constructing optimal binary decision trees is NP-complete
• On the hardness of the minimum height decision tree problem
• On the complexity of teaching
• Queries and concept learning
• Decision Trees for Geometric Models
• Point probe decision trees for geometric concept classes
• Analytical approach to parallel repetition
• Transactions on Rough Sets I
• Optimal Binary Identification Procedures

This page was built for publication: On Polynomial Time Constructions of Minimum Height Decision Tree