A 2.5n-Lower Bound on the Combinational Complexity of Boolean Functions
From MaRDI portal
A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions
Cited in
(25)- Linear lower bounds on unbounded fan-in Boolean circuits
- Relativized circuit complexity
- Models of lower-bounds proofs
- On Nečiporuk's theorem for branching programs
- A 3n-lower bound on the network complexity of Boolean functions
- Lower bounds for depth-restricted branching programs
- Nonlinear lower bounds on the number of processors of circuits with sublinear separators
- Characterizing linear size circuits in terms of privacy
- On the limits of gate elimination
- Gate elimination: circuit size lower bounds and \#SAT upper bounds
- On the complexity of planar Boolean circuits
- Feebly secure cryptographic primitives
- Circuit complexity of linear functions: gate elimination and feeble security
- The complexity of the standard multiplexer function in a class of switching circuits
- New lower bounds on circuit size of multi-output functions
- Gate elimination for linear functions and new feebly secure constructions
- Weighted Boolean formula games
- On Negations in Boolean Networks
- RelativizedNC
- A nonlinear lower bound on the practical combinational complexity
- Improving \(3N\) circuit complexity lower bounds
- A nonlinear lower bound on the practical combinational complexity
- Linear-size Boolean circuits for multiselection
- A Boolean function requiring 3n network size
- Characterization of all optimal networks for a simultaneous computation of AND and NOR
This page was built for publication: A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4131019)
