Pages that link to "Item:Q3002820"
From MaRDI portal
The following pages link to Elusive functions and lower bounds for arithmetic circuits (Q3002820):
Displaying 25 items.
- On defining integers and proving arithmetic circuit lower bounds (Q626611) (← links)
- 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)
- Lower bounds for the circuit size of partially homogeneous polynomials (Q2405138) (← 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)
- Succinct functional commitment for a large class of arithmetic circuits (Q2691602) (← 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)
- (Q4386802) (← links)
- (Q4612482) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q5121899) (← links)
- Hardness vs randomness for bounded depth arithmetic circuits (Q5121901) (← links)
- Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity (Q5368767) (← links)
- Weighted sum-of-squares lower bounds for univariate polynomials imply \(\mathsf{VP} \neq \mathsf{VNP}\) (Q6542431) (← links)
- On the closures of monotone algebraic classes and variants of the determinant (Q6582370) (← links)
- Determinants vs. algebraic branching programs (Q6624427) (← links)
