On complexity of representation of multiple-valued logic functions as polarised polynomials

Articles in the same Issue

1. Editorial
2. On inherited properties of restricted Boolean functions
3. Some properties of the inertia groups of Boolean bijunctive functions and an inductive method of generating such functions
4. On complexity of representation of multiple-valued logic functions as polarised polynomials
5. On the periodicity of the sequence of states of an automaton corresponding to a given initial state and a given periodic input sequence
6. On the analysis of fuzzy information graphs
7. Lattices of Ω-foliated formations
8. A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic
9. On some conditions for absence of a giant component in the generalised allocation scheme
10. On 2-regular graphs whose girth is one less than the maximum
11. Forthcoming Papers
12. Contents