Pages that link to "Item:Q5361867"
From MaRDI portal
The following pages link to Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits (Q5361867):
Displaying 17 items.
- Local reduction (Q1641001) (← links)
- Upper bound for torus polynomials (Q2117095) (← links)
- A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
- Computing majority by constant depth majority circuits with low fan-in gates (Q2321926) (← links)
- Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits (Q4568115) (← links)
- (Q5028364) (← links)
- A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
- (Q5090378) (← links)
- Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity (Q5091770) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5091779) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- (Q5121894) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
- String Matching: Communication, Circuits, and Learning. (Q5875515) (← links)
- Size, Depth and Energy of Threshold Circuits Computing Parity Function. (Q6065463) (← links)
- A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics (Q6089980) (← links)
- On Blocky Ranks Of Matrices (Q6489336) (← links)
