Pages that link to "Item:Q5175995"
From MaRDI portal
The following pages link to Explicit lower bound of <i>4.5n - o(n)</i> for boolena circuits (Q5175995):
Displaying 29 items.
- Correlation bounds and \#SAT algorithms for small linear-size circuits (Q344759) (← links)
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- Almost-natural proofs (Q716305) (← links)
- Negation-limited formulas (Q729897) (← links)
- A Boolean function requiring 3n network size (Q794625) (← links)
- The complexity of depth-3 circuits computing symmetric Boolean functions (Q845823) (← links)
- Reductions for monotone Boolean circuits (Q959813) (← links)
- Negation-limited complexity of parity and inverters (Q1022345) (← links)
- Lower bounds for synchronous circuits and planar circuits (Q1114661) (← links)
- Lower bounds on the area complexity of Boolean circuits (Q1193877) (← links)
- Local reduction (Q1641001) (← links)
- Size-treewidth tradeoffs for circuits computing the element distinctness function (Q1702852) (← links)
- Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
- Feebly secure cryptographic primitives (Q1946841) (← links)
- Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth (Q1989349) (← 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)
- Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
- Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits (Q3196385) (← links)
- Lower Bounds for the Size of Nondeterministic Circuits (Q3196391) (← links)
- Local Reductions (Q3448833) (← links)
- A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds (Q3502659) (← links)
- Circuits with medium fan-in (Q4601838) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- Small normalized Boolean circuits for semi-disjoint bilinear forms require logarithmic conjunction-depth (Q5121914) (← links)
- Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262) (← links)
- Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)
- Notes on Boolean read-\(k\) and multilinear circuits (Q6648273) (← links)
