Pages that link to "Item:Q4809572"
From MaRDI portal
The following pages link to On complexity of representation of multiple-valued logic functions as polarised polynomials (Q4809572):
Displaying 10 items.
- On the length of functions of \(k\)-valued logic in the class of polynomial normal forms modulo \(k\) (Q314134) (← links)
- Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms (Q314185) (← links)
- Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials (Q332332) (← links)
- Complexity of function systems over a finite field in the class of polarized polynomial forms (Q1703296) (← links)
- Lower bound for the complexity of five-valued polarized polynomials (Q1744288) (← links)
- Lower bound of the complexity of seven-valued functions in the class of polarized polynomials (Q1789733) (← links)
- Complexity of Boolean functions in the class of polarized polynomial forms (Q1918784) (← links)
- Lower bounds of complexity for polarized polynomials over finite fields (Q2002473) (← links)
- Upper bound for the length of functions over a finite field in the class of pseudopolynomials (Q2401117) (← links)
- A method for constructing polynomials of k-valued logic functions (Q4856998) (← links)