Pages that link to "Item:Q1137007"

The following pages link to A new lower bound on the monotone network complexity of Boolean sums (Q1137007):

Displaying 7 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)
• Boolean functions whose monotone complexity is of size \(n^ 2\) / log n (Q1166489) (← links)
• \(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice (Q1904667) (← links)
• Cancellation-free circuits in unbounded and bounded depth (Q2348031) (← links)
• A very simple function that requires exponential size read-once branching programs. (Q2583538) (← links)
• On Negations in Boolean Networks (Q3644711) (← links)