OAI/Combinatorics/LowSpaceSubsetSum/Separators/SeparatorFamilyExecution.lean
9 declarations, 0 contain sorry, 0 declared as axioms
Constructing all four separator families from their bounded draws
The outer recursion has exactly four stages in the application. The returned row function contains stored arrays, and lookup traverses at most four tags.
- def
OAI.LowSpaceSubsetSum.SeparatorFamilyExecution.couplingline 18 - def
OAI.LowSpaceSubsetSum.SeparatorFamilyExecution.executionline 23 - def
OAI.LowSpaceSubsetSum.SeparatorFamilyExecution.runline 28 - theorem
OAI.LowSpaceSubsetSum.SeparatorFamilyExecution.valueline 40 - theorem
OAI.LowSpaceSubsetSum.SeparatorFamilyExecution.workline 80 - def
OAI.LowSpaceSubsetSum.SeparatorFamilyExecution.Application.runline 98 - theorem
OAI.LowSpaceSubsetSum.SeparatorFamilyExecution.Application.valueline 101 - theorem
OAI.LowSpaceSubsetSum.SeparatorFamilyExecution.Application.sizesline 113 - theorem
OAI.LowSpaceSubsetSum.SeparatorFamilyExecution.Application.workline 120