Kirill A. Popkov

Short conditional complete diagnostic tests for circuits under one-type constant faults of gates

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Abstract We prove that any (almost any) n-place Boolean function can be implemented by a logic circuit in the “conjunction, disjunction, implication, negation” basis admitting a conditional complete diagnostic test of length at most n (at most n − 1, respectively) relative to constant faults of type 0 on outputs of gates.

Need a simple solution for managing your BibTeX entries? Explore CiteDrive!

  • Web-based, modern reference management
  • Collaborate and share with fellow researchers
  • Integration with Overleaf
  • Comprehensive BibTeX/BibLaTeX support
  • Save articles and websites directly from your browser
  • Search for new articles from a database of tens of millions of references
Try out CiteDrive

More from our Archive