Pages that link to "Item:Q3557502"
From MaRDI portal
The following pages link to Perturbed Identity Matrices Have High Rank: Proof and Applications (Q3557502):
Displaying 34 items.
- Lower bounds for depth-three arithmetic circuits with small bottom fanin (Q301527) (← links)
- Approximating sparse binary matrices in the cut-norm (Q498332) (← links)
- Some upper and lower bounds on PSD-rank (Q517316) (← links)
- Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin. (Q519967) (← links)
- Lower bounds for local versions of dimension reductions (Q1017913) (← links)
- Ranks of matrices with few distinct entries (Q1686308) (← links)
- Equiangular lines and spherical codes in Euclidean space (Q1692197) (← links)
- Fractional \(L\)-intersecting families (Q2001971) (← links)
- Digital almost nets (Q2112558) (← links)
- Upper bounds on communication in terms of approximate rank (Q2117081) (← links)
- Nearly orthogonal vectors and small antipodal spherical codes (Q2200040) (← links)
- Orthonormal representations of \(H\)-free graphs (Q2207591) (← links)
- On subsets of the hypercube with prescribed Hamming distances (Q2299612) (← links)
- On the number of ordinary lines determined by sets in complex space (Q2415380) (← links)
- Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
- Kolmogorov width and approximate rank (Q2423217) (← links)
- On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
- Near invariance of the hypercube (Q2630874) (← links)
- Smaller Gershgorin disks for multiple eigenvalues of complex matrices (Q2694879) (← links)
- Sets of unit vectors with small subset sums (Q2796088) (← links)
- Fooling Pairs in Randomized Communication Complexity (Q2835016) (← links)
- SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY (Q2879416) (← links)
- IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM (Q2879417) (← links)
- The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials (Q2946403) (← links)
- An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas (Q2968156) (← links)
- Small Sample Spaces Cannot Fool Low Degree Polynomials (Q3541801) (← links)
- Why Are Big Data Matrices Approximately Low Rank? (Q5025778) (← links)
- (Q5090396) (← links)
- Fractional Sylvester–Gallai theorems (Q5170981) (← links)
- On (ε,k)‐min‐wise independent permutations (Q5433268) (← links)
- Around the log-rank conjecture (Q6050267) (← links)
- Perfect and nearly perfect separation dimension of complete and random graphs (Q6186984) (← links)
- Polynomial approximation on disjoint segments and amplification of approximation (Q6198118) (← links)
- Small codes (Q6499406) (← links)
