Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On complexity of representation of multiple-valued logic functions as polarised polynomials
-
S.N. Selezneva
Veröffentlicht/Copyright:
2. Februar 2016
Abstract
The notion of a polarised polynomial form is extended to the case of multiple-valued logic functions. We introduce the Shannon functions of weight and length of polarised polynomial forms of multiple-valued logic functions and give some bounds for them.
Published Online: 2016-2-2
Published in Print: 2002-6-1
© 2016 by Walter de Gruyter Berlin/Boston
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Editorial
- On inherited properties of restricted Boolean functions
- Some properties of the inertia groups of Boolean bijunctive functions and an inductive method of generating such functions
- On complexity of representation of multiple-valued logic functions as polarised polynomials
- On the periodicity of the sequence of states of an automaton corresponding to a given initial state and a given periodic input sequence
- On the analysis of fuzzy information graphs
- Lattices of Ω-foliated formations
- A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic
- On some conditions for absence of a giant component in the generalised allocation scheme
- On 2-regular graphs whose girth is one less than the maximum
- Forthcoming Papers
- Contents
Artikel in diesem Heft
- Editorial
- On inherited properties of restricted Boolean functions
- Some properties of the inertia groups of Boolean bijunctive functions and an inductive method of generating such functions
- On complexity of representation of multiple-valued logic functions as polarised polynomials
- On the periodicity of the sequence of states of an automaton corresponding to a given initial state and a given periodic input sequence
- On the analysis of fuzzy information graphs
- Lattices of Ω-foliated formations
- A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic
- On some conditions for absence of a giant component in the generalised allocation scheme
- On 2-regular graphs whose girth is one less than the maximum
- Forthcoming Papers
- Contents
