Testing MAX-CUT in the Adjacency Matrix Model: Tight Non-Adaptive Bounds and a Cubic Adaptive Lower Bound
cs.DS
Submitted: 2026-10-31
Updated: 2026-11-03
Terminology
Sources
- Analysis of Boolean Functions
- Sampling from large matrices: an approach through geometric functional analysis
- Conjecture on the maximum cut and bisection width in random regular graphs
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time