Pages that link to "Item:Q1133519"

The following pages link to Switching functions whose monotone complexity is nearly quadratic (Q1133519):

Displaying 8 items.

• An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution (Q1066118) (← links)
• Lower bounds on monotone complexity of the logical permanent (Q1071001) (← links)
• A method for obtaining efficient lower bounds for monotone complexity (Q1112792) (← links)
• On another Boolean matrix (Q1137982) (← links)
• Boolean functions whose monotone complexity is of size \(n^ 2\) / log n (Q1166489) (← links)
• A counterexample to a conjecture of Schnorr referring to monotone networks (Q1255472) (← links)
• On algorithm complexity (Q2453388) (← links)
• On Negations in Boolean Networks (Q3644711) (← links)