Pages that link to "Item:Q4978010"
From MaRDI portal
The following pages link to Probabilistic rank and matrix rigidity (Q4978010):
Displaying 15 items.
- 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)
- 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)
- 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)
