1
$\begingroup$

Could you direct me to papers that survey families of algorithms? The ideal paper would focus on a single family of algorithms, would show how the improvements in each algorithm work, and ideally would perform this meta-analysis within a single paradigm. This paper comes close to this ideal.

$\endgroup$
  • 2
    $\begingroup$ The Handbook of Satisfiability (amazon.com/…) has a long history and chapters on major satisfiability algorithms. There are a number of survey articles on fast matrix multiplication. For instance, Fast Matrix Multiplication by Mark Blaser. mathoverflow.net/questions/34173/fast-matrix-multiplication has a number of papers, and Ran Raz has proven lower bounds of $\Omega(n^2 \log n)$ for any matrix multiplication algorithm in On the Complexity of the Matrix Product. $\endgroup$ – botsina Sep 4 at 16:36

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.