OAI/Combinatorics/MatchingCount/Complexity/TreePolynomialGCD.lean

GitHub source file

16 declarations, 0 contain sorry, 0 declared as axioms

1. lemma OAI.MatchingFPRAS.TreeTyped.polynomial_boolNot line 11
2. lemma OAI.MatchingFPRAS.TreeTyped.polynomial_boolAnd line 14
3. lemma OAI.MatchingFPRAS.TreeTyped.polynomial_natEqual line 17
4. lemma OAI.MatchingFPRAS.TreeTyped.polynomial_quotient line 23
5. lemma OAI.MatchingFPRAS.TreeTyped.polynomial_remainder line 24
6. lemma OAI.MatchingFPRAS.TreeTyped.polynomial_digits line 25
7. lemma OAI.MatchingFPRAS.TreeTyped.polynomial_bitSize line 31
8. lemma OAI.MatchingFPRAS.TreeTyped.polynomial_sortedPair line 34
9. lemma OAI.MatchingFPRAS.TreeTyped.polynomial_gcdStep line 37
10. lemma OAI.MatchingFPRAS.TreeTyped.gcdStep_size_le line 42
11. lemma OAI.MatchingFPRAS.TreeTyped.polynomial_gcd line 49
12. lemma OAI.MatchingFPRAS.TreeFraction.polynomial_normalize line 84
13. lemma OAI.MatchingFPRAS.TreeFraction.polynomial_mul line 93
14. lemma OAI.MatchingFPRAS.TreeFraction.polynomial_add line 98
15. lemma OAI.MatchingFPRAS.TreeFraction.polynomial_div line 107
16. lemma OAI.MatchingFPRAS.TreeFraction.polynomial_less line 112