On the synthesis of circuits admitting complete fault detection test sets of constant length under arbitrary constant faults at the outputs of the gates

Articles in the same Issue

1. Masthead
2. Distance-regular graph with the intersection array {45, 30, 7; 1, 2, 27} does not exist
3. The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem
4. Traveling salesman polytopes and cut polytopes. Affine reducibility
5. Minors of the constraint matrix in multi-index transport problems
6. Cycle structure of power mappings in a residue classes ring
7. A criterion for the automata realizable functions to be boundedly deterministic
8. On the complexity of two-dimensional discrete logarithm problem in a finite cyclic group with effective automorphism of order
9. The completeness criterion for some systems containing P-sets of automaton functions
10. On the synthesis of circuits admitting complete fault detection test sets of constant length under arbitrary constant faults at the outputs of the gates
11. Factorially solvable rings
12. Identities with permutations and quasigroups isotopic to groups and to Abelian groups
13. Classes of projectively equivalent quadrics over local rings