Recognizing the nonrepeating property in an arbitrary basis
From MaRDI portal
Publication:876600
DOI10.1007/S10598-007-0006-ZzbMATH Open1107.94017OpenAlexW1975136501MaRDI QIDQ876600FDOQ876600
Authors: A. A. Voronenko
Publication date: 19 April 2007
Published in: Computational Mathematics and Modeling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10598-007-0006-z
Recommendations
- On testing repetition-free functions
- Some test length bounds for nonrepeating functions in the \(\{ \& , \vee \}\) basis
- On the length of diagnostic tests for Boolean circuits
- On the relationship between diagnostic and checking tests of the read-once functions
- Short complete diagnostic tests for logic circuits in one infinite basis
Cites Work
Cited In (2)
This page was built for publication: Recognizing the nonrepeating property in an arbitrary basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876600)