Polynomial-Space Quantum Algorithms from Classical Branching: Colouring, Domination and Monotone Local Search
cs.DS, cs.CC, quant-ph
Submitted: 2026-11-09
Updated: 2026-11-09
Code: https://github.com/ssenge/LAIF
Terminology
Sources
- 3-Coloring in Time O(1.3289^n)
- Fast algorithms for min independent dominating set
- Unit Interval Editing is Fixed-Parameter Tractable
- Linear Recognition of Almost Interval Graphs
- On group feedback vertex set parameterized by the size of the cutset
- Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
- Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations
- Approximate Monotone Local Search for Weighted Problems
- Exact Algorithms via Monotone Local Search
- Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems
- Improved Analysis of Highest-Degree Branching for Feedback Vertex Set
- Half-integrality, LP-branching and FPT Algorithms
- Algorithms for Cut Problems on Trees
- Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations
- 3-Coloring in Time O(1.3217^n)
- Quantum walk speedup of backtracking algorithms
- Exponential-time quantum algorithms for graph coloring problems
- A Multivariate Framework for Weighted FPT Algorithms
- Faster parameterized algorithm for Cluster Vertex Deletion
- Faster parameterized algorithm for 3-Hitting Set
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