On the number of minimal tests checking the block circuits of parity functions for closings

Articles in the same Issue

1. Bent functions on a finite Abelian group
2. On the complexity of completeness recognition of systems of Boolean functions realized in the form of Zhegalkin polynomials
3. On the number of minimal tests checking the block circuits of parity functions for closings
4. On closed classes of polynomials over finite fields
5. Action of the automorphism group of a finite graded partially ordered set on the levels
6. Classes of directed graded graphs with polynomially solvable cardinality Steiner problem
7. The total vertex separation number of a graph
8. A new equilibrium in cyclic games on graphs
9. On a type of assigning a colour from given sets to the edges of a graph