Pages that link to "Item:Q1918784"

The following pages link to Complexity of Boolean functions in the class of polarized polynomial forms (Q1918784):

Displaying 23 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)
• Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms (Q326257) (← links)
• On some series of bases for the set of Boolean functions (Q326283) (← links)
• Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials (Q332332) (← links)
• Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts (Q344027) (← links)
• The length of a single fault detection test for constant-nonpreserving element insertions (Q830998) (← links)
• Properties of polynomials of periodic functions and the complexity of periodicity detection by the Boolean function polynomial (Q892606) (← 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)
• A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials (Q1759162) (← links)
• Lower bound of the complexity of seven-valued functions in the class of polarized polynomials (Q1789733) (← links)
• On complexity of a particular Boolean functions class (Q1943910) (← links)
• Lower bounds of complexity for polarized polynomials over finite fields (Q2002473) (← links)
• On length of Boolean functions of a small number of variables in the class of pseudo-polynomials (Q2215245) (← links)
• Complexity lower bound for Boolean functions in the class of extended operator forms (Q2306843) (← links)
• Upper bound for the length of functions over a finite field in the class of pseudopolynomials (Q2401117) (← links)
• On upper bounds of the complexity of functions over nonprime finite fields in some classes of polarized polynomials (Q2627175) (← links)
• Complexity of Boolean functions' representations in classes of extended pair-generated operator forms (Q2633615) (← links)
• On the complexity of representation of k-valued functions by generalised polarised polynomials (Q3225903) (← links)
• On complexity of representation of multiple-valued logic functions as polarised polynomials (Q4809572) (← links)
• On the mean evaluation of polynomially reducible Boolean functions (Q5936693) (← links)
• Polynomial expansions of Boolean functions in images of nonhomogeneous operators (Q5951301) (← links)
• Approximate evaluations of characteristic polynomials of Boolean functions (Q5958111) (← links)