OAI/Computability/MinUncut/Games/GraphIterationBounds.lean
12 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.MinUncutGames.Foundations.Complexity.GraphIterationBounds.inputBitsline 13 - def
OAI.MinUncutGames.Foundations.Complexity.GraphIterationBounds.countedBitsline 15 - def
OAI.MinUncutGames.Foundations.Complexity.GraphIterationBounds.wordsline 17 - def
OAI.MinUncutGames.Foundations.Complexity.GraphIterationBounds.countline 20 - def
OAI.MinUncutGames.Foundations.Complexity.GraphIterationBounds.lengthPolynomialline 22 - theorem
OAI.MinUncutGames.Foundations.Complexity.GraphIterationBounds.inputBits_le_countedBitsline 25 - theorem
OAI.MinUncutGames.Foundations.Complexity.GraphIterationBounds.size_le_inputBitsline 29 - theorem
OAI.MinUncutGames.Foundations.Complexity.GraphIterationBounds.count_leline 34 - theorem
OAI.MinUncutGames.Foundations.Complexity.GraphIterationBounds.intermediate_sizeline 38 - theorem
OAI.MinUncutGames.Foundations.Complexity.GraphIterationBounds.intermediate_bitsline 46 - def
OAI.MinUncutGames.Foundations.Complexity.GraphIterationBounds.runtimePolynomialline 62 - theorem
OAI.MinUncutGames.Foundations.Complexity.GraphIterationBounds.runtimePolynomial_evalline 66