Complexity of Boolean functions in the class of canonical polarized polynomials
From MaRDI portal
Recommendations
- Complexity of Boolean functions in a class of canonical polarized polynomials
- Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms
- Complexity of Boolean functions in the class of polarized polynomial forms
- On the complexity of polarised polynomials of multi-valued logic functions in one variable
- scientific article; zbMATH DE number 4002032
Cited in
(12)- On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
- scientific article; zbMATH DE number 4002032 (Why is no real title available?)
- On complexity of representation of multiple-valued logic functions as polarised polynomials
- On the complexity of polarised polynomials of multi-valued logic functions in one variable
- Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms
- Approximate evaluations of characteristic polynomials of Boolean functions
- Properties of polynomials of periodic functions and the complexity of periodicity detection by the Boolean function polynomial
- Complexity of Boolean functions in a class of canonical polarized polynomials
- Upper bound for the length of functions over a finite field in the class of pseudopolynomials
- Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
- On the mean evaluation of polynomially reducible Boolean functions
- Complexity of Boolean functions in the class of polarized polynomial forms
This page was built for publication: Complexity of Boolean functions in the class of canonical polarized polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4836159)
