The following pages link to Some remarks on Boolean sums (Q1133518):
Displaying 11 items.
- Separating OR, SUM, and XOR circuits (Q269494) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- On a small class of Boolean sums (Q671372) (← links)
- An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution (Q1066118) (← links)
- A method for obtaining efficient lower bounds for monotone complexity (Q1112792) (← 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)
- On algorithm complexity (Q2453388) (← links)
- A very simple function that requires exponential size read-once branching programs. (Q2583538) (← links)
- On Negations in Boolean Networks (Q3644711) (← links)