Pages that link to "Item:Q2306843"

The following pages link to Complexity lower bound for Boolean functions in the class of extended operator forms (Q2306843):

Displaying 9 items.

• Exact lower time bounds for computing Boolean functions on CREW PRAMs (Q1329159) (← links)
• Periodic Boolean functions and a lower bound for the complexity of operators (Q1878549) (← links)
• Computational bound on complexity of polynomial representations of Boolean functions (Q1943917) (← links)
• On decompositions of decision function quality measure (Q2215242) (← links)
• On length of Boolean functions of a small number of variables in the class of pseudo-polynomials (Q2215245) (← links)
• Primitivity, uniform minimality, and state complexity of Boolean operations (Q2322701) (← links)
• Complexity of Boolean functions' representations in classes of extended pair-generated operator forms (Q2633615) (← links)
• On the complexity of the evaluation of transient extensions of Boolean functions (Q2909178) (← links)
• (Q3822100) (← links)