The following pages link to (Q3002820):
Displayed 17 items.
- Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
- Multi-\(k\)-ic depth three circuit lower bound (Q1694000) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization (Q2117077) (← links)
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q2204092) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant (Q2514144) (← links)
- Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science (Q2672320) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
- On the Power of Homogeneous Depth 4 Arithmetic Circuits (Q2968157) (← links)
- Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845) (← links)
- (Q4612482) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- (Q5121899) (← links)
- (Q5121901) (← links)