OAI/Combinatorics/EditApproximation/Binary/BinaryPreparedListBounds.lean

GitHub source file

6 declarations, 0 contain sorry, 0 declared as axioms

Literal candidate counts of the three local loops, on every seed.

  1. theorem OAI.EditApproximation.BinaryFraction.dyadicScales_length_bits line 12
  2. theorem OAI.EditApproximation.BinaryFraction.queryExponentsWithWork_length_le line 17
  3. theorem OAI.EditApproximation.BinaryFraction.localRepresentativesWithWork_scale_bits line 25
  4. theorem OAI.EditApproximation.BinaryFraction.localRepresentativesWithWork_length_le line 40
  5. theorem OAI.EditApproximation.BinaryFraction.preparedLocalCellGroupsWithWork_length_le line 65
  6. theorem OAI.EditApproximation.BinaryFraction.preparedLocalOnlineActionsWithWork_length_le line 88