On the Complexity of Estimating the Size of a Test Set

DOI10.1109/TC.1984.5009364MaRDI QIDQ3331146zbMATH OpenOpenAlexFDO

Authors Balakrishnan Krishnamurthy, S. B. Akers

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

combinational circuitsNP-hardredundancysize of a test settest generation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the complexity of test case generation for NP-hard problems
• On the Fault Testing for Reversible Circuits
• The Complexity of Fault Detection Problems for Combinational Logic Circuits
• Generating hard satisfiability problems
• Vector sets for exhaustive testing of logic circuits

Cited in

(4)

• Approximate testing with error relative to input size.
• scientific article; zbMATH DE number 1332677 (Why is no real title available?)
• On efficiency of estimation and testing with data quantized to fixed number of cells
• On the complexity of test case generation for NP-hard problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3331146)