Pages that link to "Item:Q623498"
From MaRDI portal
The following pages link to Quadratic lower bound for permanent vs. determinant in any characteristic (Q623498):
Displaying 11 items.
- A note on the determinant and permanent problem (Q1263283) (← links)
- Permanent v. determinant: an exponential lower bound assuming symmetry and a potential path towards Valiant's conjecture (Q1679675) (← links)
- A lower bound on determinantal complexity (Q2087768) (← links)
- Quadratic lower bounds for algebraic branching programs and formulas (Q2159469) (← links)
- A quadratic lower bound for homogeneous algebraic branching programs (Q2323359) (← links)
- Rectangular Kronecker coefficients and plethysms in geometric complexity theory (Q2404629) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- A quadratic bound for the determinant and permanent problem (Q4661386) (← links)
- No occurrence obstructions in geometric complexity theory (Q4961749) (← links)
- A quadratic lower bound for algebraic branching programs (Q5092449) (← links)
- Determinants vs. algebraic branching programs (Q6624427) (← links)
