OAI/Combinatorics/LowSpaceSubsetSum/Representation/RepresentationLayoutExecution.lean

GitHub source file

4 declarations, 0 contain sorry, 0 declared as axioms

Materializing the bounded layout draw

An accepted permutation is stored as an indexed array, and the independent sign bits are scanned into a bounded mask. Failed permutation draws halt without using the coupling's ideal backup.

  1. def OAI.LowSpaceSubsetSum.RepresentationLayoutExecution.run line 18
  2. theorem OAI.LowSpaceSubsetSum.RepresentationLayoutExecution.value line 28
  3. theorem OAI.LowSpaceSubsetSum.RepresentationLayoutExecution.complete line 54
  4. theorem OAI.LowSpaceSubsetSum.RepresentationLayoutExecution.work line 88