Generalized CNF for "At Least k, given n variables"

Formula & questionable eyeball proof to convert "at least k" constraints to CNF for easier use with the resolution algorithm.

📆 28 Dec '23 | 📋 Essay Math A.I. CS3243

Finding Big O from non-standard recurrence relations without master method

A questionable proof to find recurrence relations for most T(n) = aT(n/b) + O(k). I also explain some intuition behind recursion trees. Probably useful for my CS2040 (DSA) pals.

📆 05 Mar '23 | 📋 Essay CS2040 Math