Answers are grounded in this paper and cite their sources.
Most NP-completeness results for test generation problems involve a reduction to the redundancy problem, which explicitly encodes the satisfiability problem. In this correspondence we investigate the complexity of a more modest problem-that of estimating the size of a test set under the constraint that the circuit is irredundant. We show that even this constrained problem is NP-hard in the strong sense.
No takes yet. Share an insight, caveat, or question.
Krishnamurthy et al. (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: