The following pages link to (Q5656695):
Displaying 8 items.
- Separating OR, SUM, and XOR circuits (Q269494) (← links)
- An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution (Q1066118) (← links)
- On the complexity of slice functions (Q1066866) (← links)
- More on the complexity of slice functions (Q1079365) (← links)
- Some remarks on Boolean sums (Q1133518) (← links)
- On another Boolean matrix (Q1137982) (← links)
- Boolean functions whose monotone complexity is of size \(n^ 2\) / log n (Q1166489) (← links)
- A very simple function that requires exponential size read-once branching programs. (Q2583538) (← links)