Approximation guarantees
Lax213208.RApproximation · concepts/Lax213208/RApproximation.lean · lax-213208
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
A program approximates within if it returns a feasible -approximate solution on every instance in the class. This requires termination, with no restriction on running time.
The optional integer precision selects the scheme input convention. Both ordinary algorithms and schemes use this same predicate.
Concept map
Lean source view on GitHub
| 1 | import Lax213208.Approximation |
| 2 | import Lax213208.AlgorithmInput |
| 3 | import Lax213208.Programs |
| 4 | |
| 5 | /-! |
| 6 | --- |
| 7 | title: Approximation guarantees |
| 8 | type: definition |
| 9 | --- |
| 10 | A program approximates within if it returns a feasible |
| 11 | -approximate solution on every instance in the class. This requires |
| 12 | termination, with no restriction on running time. |
| 13 | |
| 14 | The optional integer precision selects the scheme input convention. Both ordinary |
| 15 | algorithms and schemes use this same predicate. |
| 16 | -/ |
| 17 | |
| 18 | namespace Lax213208.RApproximation |
| 19 | |
| 20 | open OptimizationProblem Approximation AlgorithmInput Programs |
| 21 | |
| 22 | variable {Instance Solution : Type*} {problem : Problem Instance Solution} |
| 23 | |
| 24 | def Approximates (alg : Program) (inputs : Set Instance) (r : ℝ) |
| 25 | (precision : Option ℕ := none) : Prop := |
| 26 | 1 ≤ r ∧ ∀ x ∈ inputs, ∃ y, |
| 27 | Returns alg (inputTape problem precision x) (problem.output y) ∧ |
| 28 | IsApproximation problem r x y |
| 29 | |
| 30 | end Lax213208.RApproximation |
| 31 |
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments