A randomized algorithm maintains O(Δ / ln Δ) coloring of dynamically changing triangle-free graphs with amortized Δ^{o(1)} log n update time per edge update against an adaptive adversary.
and Nirkhe, Chinmay , title =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Faster quantum algorithm outputs a state whose energy is at most the minimum energy among all depth-d circuits applied to |0>, plus an energy estimate, for k-local Hamiltonians.
Every class with Gaussian surface area at most Gamma admits degree O-tilde(Gamma squared over epsilon squared) non-negative L1-approximating polynomials for its indicators under the standard Gaussian.
citing papers explorer
-
Fully Dynamic Algorithms for Coloring Triangle-Free Graphs
A randomized algorithm maintains O(Δ / ln Δ) coloring of dynamically changing triangle-free graphs with amortized Δ^{o(1)} log n update time per edge update against an adaptive adversary.
-
An Entropy-Governed Speedup for Quantum Algorithms on Local Hamiltonians
Faster quantum algorithm outputs a state whose energy is at most the minimum energy among all depth-d circuits applied to |0>, plus an energy estimate, for k-local Hamiltonians.
-
A Note on Non-Negative $L_1$-Approximating Polynomials
Every class with Gaussian surface area at most Gamma admits degree O-tilde(Gamma squared over epsilon squared) non-negative L1-approximating polynomials for its indicators under the standard Gaussian.