On the complexity of Boolean matrices, graphs, and the Boolean functions corresponding to them

Articles in the same Issue

1. A public-key cryptosystem based on binary Reed-Muller codes
2. On precomplete classes in Cartesian products of P₂and P₃
3. On the complexity of Boolean matrices, graphs, and the Boolean functions corresponding to them
4. Limit distributions of the number of cyclic points of stable random mappings
5. Complexity of Boolean functions in the class of canonical polarized polynomials
6. On the distribution of the spectral complexity of Boolean functions
7. Some properties of mutually inverse systems of p-valued logic functions