Decision Trees and Diagrams
- 1 December 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 14 (4), 593-623
- https://doi.org/10.1145/356893.356898
Abstract
No abstract availableThis publication has 63 references indexed in Scilit:
- Selection criteria for the construction of efficient diagnostic keysJournal of Statistical Planning and Inference, 1981
- Equivalence of free boolean graphs can be decided probabilistically in polynomial timeInformation Processing Letters, 1980
- A Survey of Analysis Techniques for Discrete AlgorithmsACM Computing Surveys, 1977
- Reticulation and Other Methods of Reducing the Size of Printed Diagnostic KeysJournal of General Microbiology, 1977
- Optimal sequential arrangement of evaluation trees for boolean functionsInformation Sciences, 1976
- The synthetic approach to decision table conversionCommunications of the ACM, 1976
- Extending the infomation theory approach to converting limited-entry decision tables to computer programsCommunications of the ACM, 1974
- Application of game tree searching techniques to sequential pattern recognitionCommunications of the ACM, 1971
- Conversion of Limited-Entry Decision Tables to Optimal Computer Programs IIJournal of the ACM, 1967
- In which order are different conditions to be examined?BIT Numerical Mathematics, 1963