Pages that link to "Item:Q4612481"
From MaRDI portal
The following pages link to New algorithms and lower bounds for circuits with linear threshold gates (Q4612481):
Displaying 25 items.
- Local reduction (Q1641001) (← links)
- Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
- Average-case rigidity lower bounds (Q2117087) (← links)
- Upper bound for torus polynomials (Q2117095) (← links)
- A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
- Predicate encryption from bilinear maps and one-sided probabilistic rank (Q2175910) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms (Q2701071) (← links)
- Local Reductions (Q3448833) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
- (Q4612476) (← links)
- On polynomial approximations to AC (Q4633319) (← links)
- Depth Reduction for Composites (Q4634033) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- (Q5005182) (← links)
- (Q5009542) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- (Q5090378) (← links)
- Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity (Q5091770) (← links)
- (Q5121894) (← links)
- Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843) (← links)
- (Q5259553) (redirect page) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
