Properly learning decision trees with queries is NP-hard - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Caleb Koch, Carmen Strassle, Li-Yang Tan. Properly learning decision trees with queries is NP-hard. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023. pages 2383-2407, IEEE, 2023. [doi]

This author has not been identified. Look up 'Caleb Koch' in GoogleThis author has not been identified. Look up 'Carmen Strassle' in GoogleThis author has not been identified. Look up 'Li-Yang Tan' in Google

runs on WebDSL