OAI/Combinatorics/EditApproximation/Coarse/CoarseBinaryBox.lean
11 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.EditApproximation.BinaryFraction.CoarseBinaryBoxline 9Source documentation
A zero marker or one full shift array on the execution's common grid.
def CoarseBinaryBox (two : BinaryFraction) (n V D A : ℕ) (array : CoarseBinaryArray) : Prop := …
Mentions: OAI.EditApproximation.BinaryFraction, OAI.EditApproximation.BinaryFraction.CoarseBinaryArray
- theorem
OAI.EditApproximation.BinaryFraction.coarseBinaryBox_noneline 12 - theorem
OAI.EditApproximation.BinaryFraction.coarseBinaryBox_monoline 16 - theorem
OAI.EditApproximation.BinaryFraction.coarseGridZipAddWithWork_boundsline 22 - theorem
OAI.EditApproximation.BinaryFraction.coarseGridZipAddWithWork_lengthline 41 - theorem
OAI.EditApproximation.BinaryFraction.coarseBinaryAddWithWork_boxline 54 - theorem
OAI.EditApproximation.BinaryFraction.coarseBinaryAddWithWork_costline 72 - theorem
OAI.EditApproximation.BinaryFraction.coarseBinaryPenaltyWithWork_boxline 87 - theorem
OAI.EditApproximation.BinaryFraction.coarseBinaryPenaltyWithWork_costline 103 - theorem
OAI.EditApproximation.BinaryFraction.coarseBinaryMapWithWork_boxline 114 - theorem
OAI.EditApproximation.BinaryFraction.coarseBinaryMapWithWork_costline 131