An Efficient Algorithm for Finding Certain Minimum-Cost Procedures for Making Binary Decisions
From MaRDI portal
Publication:5736474
DOI10.1145/321229.321230zbMath0123.33707OpenAlexW2036836098MaRDI QIDQ5736474
Publication date: 1964
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321229.321230
Related Items (3)
Performance bounds for binary testing with arbitrary weights ⋮ Algorithms for fast evaluation of Boolean expressions ⋮ Optimal sequential arrangement of evaluation trees for Boolean functions
This page was built for publication: An Efficient Algorithm for Finding Certain Minimum-Cost Procedures for Making Binary Decisions
