The infimum η such that uniformly rainbow-free coloring admits an O(n^η) kernel is fully characterized for all d, ℓ, q under the assumption NP ⊈ coNP/poly.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Kernelization Bounds for Constrained Coloring
The infimum η such that uniformly rainbow-free coloring admits an O(n^η) kernel is fully characterized for all d, ℓ, q under the assumption NP ⊈ coNP/poly.