Proof of `Truly subcubic all-pairs shortest paths`
groundedproofs/Lax350013Proofs/Certificates.lean · lax-350013
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.
Description
The upstream conversion from the certified real-exponent bound to the rational-exponent formulation, preserving the program and input/output semantics.