The following pages link to Twice-Ramanujan Sparsifiers (Q4910582):
Displayed 48 items.
- Random projections for Bayesian regression (Q144017) (← links)
- Zonoids and sparsification of quantum measurements (Q259783) (← links)
- Covariance estimation for distributions with \({2+\varepsilon}\) moments (Q378788) (← links)
- Dimension reduction for finite trees in \(\ell_1\) (Q393734) (← links)
- The Marcinkiewicz-type discretization theorems (Q1615927) (← links)
- Entropy numbers and Marcinkiewicz-type discretization (Q2039830) (← links)
- Upper and lower bounds for matrix discrepancy (Q2090579) (← links)
- Interlacing families. III: Sharper restricted invertibility estimates (Q2143246) (← links)
- Four deviations suffice for rank 1 matrices (Q2213767) (← links)
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760) (← links)
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem (Q2352912) (← links)
- On the convergence of the extremal eigenvalues of empirical covariance matrices with dependence (Q2413247) (← links)
- Remarks on sampling discretization of integral norms of functions (Q2685182) (← links)
- Faster cut sparsification of weighted graphs (Q2696277) (← links)
- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis (Q2922627) (← links)
- Graphs, Vectors, and Matrices (Q3178747) (← links)
- Enhancing Pure-Pixel Identification Performance via Preconditioning (Q3192648) (← links)
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
- On‐line balancing of random inputs (Q3386519) (← links)
- Approximation Algorithms for <i>D</i>-optimal Design (Q3387934) (← links)
- Lunin's method for selecting large submatrices with small norm (Q3454663) (← links)
- Minimum Cuts and Sparsification in Hypergraphs (Q4561257) (← links)
- Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time (Q4562276) (← links)
- Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes (Q4562281) (← links)
- Restricted Invertibility Revisited (Q4604394) (← links)
- Steiner Point Removal with Distortion $O(\log {k})$ using the Relaxed-Voronoi Algorithm (Q4634019) (← links)
- On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models (Q4637075) (← links)
- Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers (Q4993313) (← links)
- Shape Simplification Through Graph Sparsification (Q5082141) (← links)
- Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design (Q5085119) (← links)
- (Q5090371) (← links)
- Sparsification of Binary CSPs (Q5090464) (← links)
- (Q5091249) (← links)
- A Local Search Framework for Experimental Design (Q5092507) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- Integral norm discretization and related problems (Q5220242) (← links)
- Sparsification of Binary CSPs (Q5220474) (← links)
- Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds (Q5251753) (← links)
- Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs (Q5252687) (← links)
- The legacy of Jean Bourgain in geometric functional analysis (Q5854479) (← links)
- Continuous quantitative Helly-type results (Q5863161) (← links)
- (Q5874542) (← links)
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) (← links)
- Comparison of matrix norm sparsification (Q6066776) (← links)
- The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions (Q6139829) (← links)
- Universal sampling discretization (Q6182696) (← links)
- Geometric bounds on the fastest mixing Markov chain (Q6193769) (← links)