Pages that link to "Item:Q4522714"

The following pages link to On the complexity of completeness recognition of systems of Boolean functions realized in the form of Zhegalkin polynomials (Q4522714):

Displaying 7 items.

• Polynomial-time algorithms for checking some properties of Boolean functions given by polynomials (Q285507) (← links)
• On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials (Q1407293) (← links)
• Finding periods of Zhegalkin polynomials (Q2088723) (← links)
• The algorithm for completeness recognizing in function algebra \(L(\mathbb{Z})\) (Q2344101) (← links)
• (Q3074627) (← links)
• A polynomial algorithm for the recognition of belonging a function of k-valued logic realized by a polynomial to precomplete classes of self-dual functions (Q4522761) (← links)
• On complexity of searching for periods of functions given by polynomials over a prime field (Q5878613) (← links)