Pages that link to "Item:Q1142030"

The following pages link to A 3n-lower bound on the network complexity of Boolean functions (Q1142030):

Displayed 8 items.

• A nonlinear lower bound on the practical combinational complexity (Q673076) ‎ (← links)
• A Boolean function requiring 3n network size (Q794625) ‎ (← links)
• Linear lower bounds on unbounded fan-in Boolean circuits (Q1068792) ‎ (← links)
• Nonlinear lower bounds on the number of processors of circuits with sublinear separators (Q1183605) ‎ (← links)
• The multiplicative complexity of quadratic boolean forms (Q1199694) ‎ (← links)
• The complexity of the standard multiplexer function in a class of switching circuits (Q2095998) ‎ (← links)
• Parity, circuits, and the polynomial-time hierarchy (Q3318683) ‎ (← links)
• A nonlinear lower bound on the practical combinational complexity (Q5096789) ‎ (← links)