While this submission is a draft, it cannot be used by other submissions.

Proof of `Quasipolynomial bounds for the computed algorithm budgets`

groundedproofs/Lax263307Proofs/ParameterResources.lean · lax-263307

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub