OAI/Combinatorics/ContingencyTables/Sampling/FirstPaperWordBudget.lean
7 declarations, 0 contain sorry, 0 declared as axioms
A polynomial bound for the full first-paper Boolean word
- def
OAI.ContingencyTables.smallSamplerWordBudgetline 10Source documentation
Each outer trial contains a small walk and a fresh completion word.
def smallSamplerWordBudget (d b k : ℕ) : ℕ := …
- lemma
OAI.ContingencyTables.double_power_leline 14 - lemma
OAI.ContingencyTables.one_mul_powerline 19 - lemma
OAI.ContingencyTables.natPower_mulline 22 - lemma
OAI.ContingencyTables.natPower_monoline 25 - theorem
OAI.ContingencyTables.wordBudget_boundline 28 - theorem
OAI.ContingencyTables.smallSamplerWordBudget_polynomialline 83