OAI/Combinatorics/EditApproximation/Coarse/CoarseWorkEnvelope.lean
1 declarations, 0 contain sorry, 0 declared as axioms
The actual coarse first-request factor times the width budget remains almost linear. This bound does not assume any seed-correctness event.
- theorem
OAI.EditApproximation.computed_coarse_widthWork_near_linearline 13