OAI/Combinatorics/EditApproximation/Queries/QueryHistoryBounds.lean

GitHub source file

4 declarations, 0 contain sorry, 0 declared as axioms

Cost of generating the earlier-history input list from child grids. The bound counts the actual nested lists before duplicate removal.

  1. theorem OAI.EditApproximation.arithmeticFlatMapWithWork_length line 11
  2. def OAI.EditApproximation.BinaryFraction.historyChildRun line 33
  3. theorem OAI.EditApproximation.BinaryFraction.historyChildRun_bounds line 40
  4. theorem OAI.EditApproximation.BinaryFraction.queryRawHistoryInputsWithWork_bounds line 70