OAI/Combinatorics/MatchingCount/Complexity/TreeChoiceCosts.lean

GitHub source file

14 declarations, 0 contain sorry, 0 declared as axioms

1. def OAI.MatchingFPRAS.TreeTyped.takeFast line 12
2. lemma OAI.MatchingFPRAS.TreeTyped.polynomial_takeFast line 18
3. lemma OAI.MatchingFPRAS.TreeTyped.polynomial_bitValue line 26
4. lemma OAI.MatchingFPRAS.TreeTyped.polynomial_bitDenominator line 32
5. lemma OAI.MatchingFPRAS.TreeTyped.polynomial_minimum line 58
6. lemma OAI.MatchingFPRAS.TreeTyped.polynomial_listMin line 62
7. def OAI.MatchingFPRAS.TreeFraction.cumulativeFast line 85
8. lemma OAI.MatchingFPRAS.TreeFraction.polynomial_cumulativeFast line 86
9. def OAI.MatchingFPRAS.ExecutableChoice.predicateFast line 93
10. lemma OAI.MatchingFPRAS.ExecutableChoice.polynomial_predicateFast line 97
11. def OAI.MatchingFPRAS.ExecutableChoice.chooseFast line 107
12. lemma OAI.MatchingFPRAS.ExecutableChoice.polynomial_chooseFast line 112
13. def OAI.MatchingFPRAS.ExecutableChoice.chooseBitsFast line 123
14. lemma OAI.MatchingFPRAS.ExecutableChoice.polynomial_chooseBitsFast line 125