Pages that link to "Item:Q1943917"

The following pages link to Computational bound on complexity of polynomial representations of Boolean functions (Q1943917):

Displaying 11 items.

• Sign-representation of Boolean functions using a small number of monomials (Q280399) (← links)
• Properties of polynomials of periodic functions and the complexity of periodicity detection by the Boolean function polynomial (Q892606) (← links)
• Reflections on ``Representations of sets of Boolean functions by commutative rings'' by Roman Smolensky (Q1377573) (← links)
• On complexity of a particular Boolean functions class (Q1943910) (← links)
• On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts (Q2018642) (← links)
• Complexity lower bound for Boolean functions in the class of extended operator forms (Q2306843) (← links)
• Complexity of Boolean functions' representations in classes of extended pair-generated operator forms (Q2633615) (← links)
• (Q3783560) (← links)
• (Q4946095) (← links)
• On the mean evaluation of polynomially reducible Boolean functions (Q5936693) (← links)
• Approximate evaluations of characteristic polynomials of Boolean functions (Q5958111) (← links)