Polynomially Complete Fault Detection Problems

IEEE Transactions on Computers

Volumn C-24, Issue 3, 1975, Pages 242-249

  Ibarra, Oscar H ^a   Sahni, Sartaj K ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Deterministic and nondeterministic computations; fault detection; irredundant circuit; polynomial time algorithm; polynomially complete; tautology problem; traveling salesman problem; Turing machines (TM S)

Indexed keywords

LOGIC CIRCUITS, COMBINATORIAL;

EID: 0016485480     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/T-C.1975.224205     Document Type: Article

References (10)

1. S. A. Cook, “The complexity of theorem proving procedures,” in Conf. Rec. 3rd ACM Symp. Theory of Computing, 1971, pp. 151–158.
2. J. E. Hoperoft and J. D. Ullman, Formal Languages and their Relation to Automata. New York: Addison-Wesley, 1969.
3. H. E. Jauch, “A new algorithm for detecting faults,” Ph.D. dissertation, Dep. Elec. Eng., Univ. Minnesota, Minneapolis, Dec. 1973.
4. R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. New York: Plenum, 1972, pp. 85–104.
5. Z. Kohavi, Switching and Finite Automata Theory. New York: McGraw-Hill, 1970.
6. S. M. Reddy, “Easily testable realizations for logic functions,” IEEE Trans. Comput., vol. C-21, pp. 1183–1188, Nov. 1972.
7. S. Sahni, “Some related problems. from network flows, game theory and integer programming,” in Conf. Rec. 13th Annu. IEEE Symp. Switching and Automata Theory, Oct. 1972.
8. K. K. Saluja and S. M. Reddy, “Multiple faults in Reed-Muller Muller canonic networks,” in Conf. Rec. 13th Annu. IEEE Symp. Switching and Automata Theory, Oct. 1972.
9. R. Sethi, “Complete register allocation problems,” in Conf. Rec. 5th ACM Symp. Theory of Computing, 1973.
10. J. D. Ullman, “Polynomial complete scheduling problems,” in Proc. IBM Conf. Operating Systems, Yorktown Heights, N. Y., Oct. 1973, pp. 96–101.