Good-string binomial-tail bound -- definitions

def Complexity.AntiChecker.caughtTupleUpperBound (arity survivors disagreements : ℕ) : ℕ

Elementary upper bound for the number of length-arity survivor tuples caught when disagreements of survivors codes disagree at an input.

Equations

• Complexity.AntiChecker.caughtTupleUpperBound arity survivors disagreements = 2 ^ arity * disagreements ^ (arity - arity / 2) * survivors ^ (arity / 2)