Pages that link to "Item:Q1679675"
From MaRDI portal
The following pages link to Permanent v. determinant: an exponential lower bound assuming symmetry and a potential path towards Valiant's conjecture (Q1679675):
Displaying 10 items.
- Binary determinantal complexity (Q286175) (← links)
- Quadratic lower bound for permanent vs. determinant in any characteristic (Q623498) (← links)
- The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices (Q1739162) (← links)
- On the complexity of the permanent in various computational models (Q2013543) (← links)
- A lower bound on determinantal complexity (Q2087768) (← links)
- Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science (Q2672320) (← links)
- Permanent v. determinant: an exponential lower bound assuming symmetry (Q2800550) (← links)
- Permanent versus determinant: Not via saturations (Q2951164) (← links)
- The Waring Rank of the 3 x 3 Permanent (Q5860385) (← links)
- Determinants vs. algebraic branching programs (Q6624427) (← links)
