Pages that link to "Item:Q4993264"

The following pages link to Barriers for Rank Methods in Arithmetic Complexity (Q4993264):

Displaying 9 items.

• Rank and border rank of Kronecker powers of tensors and Strassen's laser method (Q2062866) (← links)
• Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (Q2281256) (← links)
• Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (Q2323361) (← links)
• Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science (Q2672320) (← links)
• On the Symmetries of and Equivalence Test for Design Polynomials. (Q5092415) (← links)
• (Q6062153) (← links)
• Concise tensors of minimal border rank (Q6117846) (← links)
• Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity (Q6142335) (← links)
• New lower bounds for matrix multiplication and (Q6161101) (← links)