New classical and quantum sublinear query algorithms for (Δ+1)- and (1+ε)Δ-vertex-coloring, with the quantum results breaking the classical Ω(n^{3/2}) query lower bound.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Improved Sublinear Algorithms for Classical and Quantum Graph Coloring
New classical and quantum sublinear query algorithms for (Δ+1)- and (1+ε)Δ-vertex-coloring, with the quantum results breaking the classical Ω(n^{3/2}) query lower bound.