Discrete decision theory: manipulations
From MaRDI portal
Publication:1102136
DOI10.1016/0304-3975(87)90130-7zbMATH Open0643.68155OpenAlexW2115218192MaRDI QIDQ1102136FDOQ1102136
Publication date: 1987
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(87)90130-7
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Decision theory for games (91A35)
Cites Work
- Constructing optimal binary decision trees is NP-complete
- Optimizing decision trees through heuristically guided search
- Varieties of ”If-Then-Else“
- Diagonal algebras
- Discrete decision theory: manipulations
- Decision tree reduction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: Discrete decision theory: manipulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102136)