Author:
Chakradhar Srimat T.,Agrawal Vishwani D.,Bushnell Michael L.
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering
Reference15 articles.
1. O.H. Ibarra and S.K. Sahni, ?Polynomially complete fault detection problems,?IEEE Trans. on Computers, vol. C-24, pp. 242?249, March 1975.
2. H. Fujiwara and S. Toida, ?The complexity of fault detection problem for combinational circuits,?IEEE Trans. on Computers, vol. C-31, pp. 555?560, June 1982.
3. H. Fujiwara, ?Computational complexity of controllability/observability problems for combinational circuits,?IEEE Trans. on Computers, vol. C-39, pp. 762?767, June 1990.
4. D.J. Rose, ?On simple characterizations ofk-trees,?Discrete Mathematics, vol. 7, pp. 317?322, Feb. 1974.
5. A.V. Aho, J.E. Hopcropt, and J.D. Ullman,The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, Reading, MA, 1974.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献