Pages that link to "Item:Q3361881"
From MaRDI portal
The following pages link to A $4n$ Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions (Q3361881):
Displayed 10 items.
- Correlation bounds and \#SAT algorithms for small linear-size circuits (Q344759) (← links)
- Reductions for monotone Boolean circuits (Q959813) (← links)
- New upper bounds on the Boolean circuit complexity of symmetric functions (Q991778) (← links)
- Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
- On the power of nondeterministic circuits and co-nondeterministic circuits (Q2232269) (← links)
- New lower bounds on circuit size of multi-output functions (Q2354591) (← links)
- A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds (Q2430008) (← links)
- Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits (Q3196385) (← links)
- A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds (Q3502659) (← links)
- On Negations in Boolean Networks (Q3644711) (← links)