The hardness of the expected decision depth problem

DOI10.1016/J.IPL.2006.08.012zbMath1185.68653OpenAlexW1966141525MaRDI QIDQ845910

Amir Rosenfeld, Dana Ron, Salil P. Vadhan

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.08.012

zbMATH Keywords

computational complexitydecision trees

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Information Acquisition Under Resource Limitations in a Noisy Environment

Cites Work

• Query strategies for priced information
• A new strategy for querying priced information
• Learning with attribute costs
• Optimal Information Gathering on the Internet with Time and Cost Constraints

This page was built for publication: The hardness of the expected decision depth problem