Answers are grounded in this paper and cite their sources.
*Introduction *Mathematical Induction *Big-O and Big-...W *Recurrence Relations *Correctness Proofs *Algorithm Analysis *Divide-and-Conquer *Dynamic Programming *Greedy Algorithms *Advanced Data Structures *Exhaustive Search. *NP-completeness *Miscellaneous Bibliography
No takes yet. Share an insight, caveat, or question.
Ian Parberry (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: