The following pages link to On Sketching Quadratic Forms (Q2800579):
Displaying 12 items.
- A note on distance-preserving graph sparsification (Q2059887) (← links)
- Faster cut sparsification of weighted graphs (Q2696277) (← links)
- (Q4993305) (← links)
- Tight Bounds for the Subspace Sketch Problem with Applications (Q5009789) (← links)
- Sparsification of Binary CSPs (Q5090464) (← links)
- (Q5091249) (← links)
- Sparsification of Binary CSPs (Q5220474) (← links)
- A General Framework for Graph Sparsification (Q5232324) (← links)
- Sparsification of Two-Variable Valued Constraint Satisfaction Problems (Q5270406) (← links)
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) (← 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)
