Performance bounds for binary testing with arbitrary weights

DOI10.1007/BF00290148zbMath0605.68035OpenAlexW1975096669MaRDI QIDQ1083851

Donald W. Loveland

Publication date: 1985

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00290148

zbMATH Keywords

decision treebinary identification problemsbinary splitting rulediagnosis problemfast approximation ruleminimal cost testing proceduresnear optimal testing proceduresupper bound on approximation error

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Reliability and life testing (62N05)

Cites Work

• Constructing optimal binary decision trees is NP-complete
• Identification Keys and Diagnostic Tables: A Review
• Memory Protection in Multiprocessing Systems
• Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time
• Optimal Binary Identification Procedures
• Simple Binary Identification Problems
• An Efficient Algorithm for Finding Certain Minimum-Cost Procedures for Making Binary Decisions

This page was built for publication: Performance bounds for binary testing with arbitrary weights