Redundancy Is All You Need
Open Access
- 15 June 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1614-1625
Abstract
No abstract availableAll Related Versions
Funding Information
- National Science Foundation (CCF-2211972)
- Simons Investigator ()
This publication has 68 references indexed in Scilit:
- The algebraic structure of the densification and the sparsification tasks for CSPsConstraints, 2022
- Graph coarsening: from scientific computing to machine learningSeMA Journal, 2022
- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds2020
- Best-Case and Worst-Case Sparsifiability of Boolean CSPsAlgorithmica, 2020
- Information Graph Flow: A Geometric Approximation of Quantum and Statistical SystemsFoundations of Physics, 2018
- Kernelization of Constraint Satisfaction Problems: A Study Through Universal AlgebraLecture Notes in Computer Science, 2017
- Graph Sparsification in the Semi-streaming Model2009
- Which Problems Have Strongly Exponential Complexity?Journal of Computer and System Sciences, 2001
- On the existence of triangulated spheres in 3-graphs, and related problemsPeriodica Mathematica Hungarica, 1973
- On extremal problems of graphs and generalized graphsIsrael Journal of Mathematics, 1964