The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (1975 vol.24)
pp: 242-249
O.H. Ibarra , Department of Computer Science, University of Minnesota
ABSTRACT
We look at several variations of the single fault detection problem for combinational logic circuits and show that deciding whether single faults are detectable by input-output (I/O) experiments is polynomially complete, i.e., there is a polynomial time algorithm to decide if these single faults are detectable if and only if there is a polynomial time algorithm for problems such as the traveling salesman problem, knapsack problem, etc.
INDEX TERMS
Deterministic and nondeterministic computations, fault detection, irredundant circuit, polynomially complete, polynomial time algorithm, tautology problem, traveling salesman problem, Turing machines (TM's).
CITATION
O.H. Ibarra, S.K. Sahni, "Polynomially Complete Fault Detection Problems", IEEE Transactions on Computers, vol.24, no. 3, pp. 242-249, March 1975, doi:10.1109/T-C.1975.224205
35 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool