On the Complexity of Estimating the Size of a Test Set

DOI10.1109/TC.1984.5009364zbMath0542.94027OpenAlexW1997908542MaRDI QIDQ3331146

S. B. Akers, Balakrishnan Krishnamurthy

Publication date: 1984

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1984.5009364

zbMATH Keywords

NP-hardredundancytest generationcombinational circuitssize of a test set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: On the Complexity of Estimating the Size of a Test Set