Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Greedy leaf elimination runs in polynomial bit time

Proved
StableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree.greedy_leaf_order_bit_program

by lreyzin · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmsclusteringdynamic-programming

Compute each active list by at most n filters on the original n vertices and select the first low-degree vertex. Filtering can only decrease the encoded list length.

Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_TreeLeafSchedules
import Definitions.Def_QuantumMaxCutFiniteNumericRuntime
open StableMSR.Recovery.Supplement.BinaryRecovery.Regional
open StableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree
open OAI.MetricKMedian.Binary.Automatic
Formal statement
theorem StableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree.greedy_leaf_order_bit_program : Poly leafOrder := by
  sorry
Source
Leaf elimination implementation for the bounded-treewidth dynamic program of Ravichandran and Reyzin, arXiv:2611.03547, Appendix A.6.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me