Pages that link to "Item:Q4978010"

The following pages link to Probabilistic rank and matrix rigidity (Q4978010):

Displaying 26 items.

• On a theorem of Razborov (Q445247) (← links)
• On matrix rigidity and locally self-correctable codes (Q645122) (← links)
• Improved lower bounds on the rigidity of Hadamard matrices (Q1280658) (← links)
• Matrix rigidity of random Toeplitz matrices (Q1653338) (← links)
• Some structural properties of low-rank matrices related to computational complexity (Q1978702) (← links)
• Lower bounds for matrix factorization (Q2041242) (← links)
• Nondeterministic and randomized Boolean hierarchies in communication complexity (Q2041245) (← links)
• Matrix and tensor rigidity and \(L_p\)-approximation (Q2145080) (← links)
• Predicate encryption from bilinear maps and one-sided probabilistic rank (Q2175910) (← links)
• On the complexity of matrix rank and rigidity (Q2268340) (← links)
• New applications of the polynomial method: The cap set conjecture and beyond (Q4562036) (← links)
• Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices (Q5042455) (← links)
• A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
• (Q5090396) (← links)
• (Q5090982) (← links)
• Fourier and circulant matrices are not rigid (Q5091768) (← links)
• Lower bounds for matrix factorization (Q5092452) (← links)
• (Q5092467) (← links)
• Uniqueness of Nonnegative Matrix Factorizations by Rigidity Theory (Q5150834) (← links)
• Matrix rigidity and the Croot-Lev-Pach lemma (Q5204826) (← links)
• Matrix rigidity of random toeplitz matrices (Q5361821) (← links)
• Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
• Arithmetic circuits, structured matrices and (not so) deep learning (Q6109070) (← links)
• Rigid matrices from rectangular PCPs (Q6491304) (← links)
• Limits of preprocessing (Q6581870) (← links)
• Widths and rigidity (Q6639678) (← links)