Short complete diagnostic tests for circuits with two additional inputs in some basis

DOI10.1515/dma-2023-0020zbMath1530.94073OpenAlexW4385989326MaRDI QIDQ6051966

Kirill A. Popkov

Publication date: 20 September 2023

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2023-0020

zbMATH Keywords

Boolean functionBoolean circuitstuck-at faultcomplete diagnostic test

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10) Networks and circuits as models of computation; circuit complexity (68Q06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the length of diagnostic tests for Boolean circuits
• LOWER BOUNDS FOR LENGTHS OF COMPLETE DIAGNOSTIC TESTS FOR CIRCUITS AND INPUTS OF CIRCUITS
• Easily Testable Realizations ror Logic Functions

This page was built for publication: Short complete diagnostic tests for circuits with two additional inputs in some basis