Pages that link to "Item:Q5704311"
From MaRDI portal
The following pages link to An upper bound for complexity of polynomial normal forms of Boolean functions (Q5704311):
Displaying 5 items.
- Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms (Q314185) (← links)
- Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts (Q344027) (← links)
- On length of Boolean functions of a small number of variables in the class of pseudo-polynomials (Q2215245) (← links)
- Upper bound for the length of functions over a finite field in the class of pseudopolynomials (Q2401117) (← links)
- On the complexity of representation of k-valued functions by generalised polarised polynomials (Q3225903) (← links)
