Bit-polynomial candidate labels for rational symmetric-stability recovery
ProvedStableMSR.Recovery.Supplement.BinaryRecovery.polynomial_candidate_labelsalgorithmsclusteringcomputational-complexity
For each fixed rational stability factor greater than one, output labels in polynomial bit time and recover the partition on stable instances. This is the precise candidate-construction part of Proposition C.4. A.5 bounds the rational sizes of the particular deterministic algorithm. The statement does not require optimality or feasibility of the output on unstable inputs.
Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_BinaryRecovery import Definitions.Def_QuantumMaxCutFiniteNumericRuntime open OAI.MetricKMedian.Binary.Automatic open StableMSR.Recovery StableMSR.Recovery.Supplement StableMSR.Recovery.Supplement.BinaryRecovery
Formal statement
theorem StableMSR.Recovery.Supplement.BinaryRecovery.polynomial_candidate_labels
(γ : ℚ) (hγ : 1 < γ) : ∃ f : Input → List ℕ, Poly f ∧ Recovers f γ := by
sorry
Source
S. Ravichandran and L. Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, Theorem 1.1, Appendix A.5 (bit complexity), and Proposition C.4. https://arxiv.org/abs/2611.03547