On the complexity of decision trees, the quasi-optimizer, and the power of heuristic rules

DOI10.1016/S0019-9958(79)90321-8zbMath0397.68056OpenAlexW2044517089MaRDI QIDQ4181281

Nicholas V. Findler, Jan van Leeuwen

Publication date: 1979

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(79)90321-8

zbMATH Keywords

Complexity of Decision TreesPlaying PokerPower of Heuristic Rules

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

A heuristic approach to optimum experimental design, A note on the comparison of five heuristic optimization techniques of a certain class of decision trees, A note on computing the asymptotic form of a limited sequence of decision trees