4
$\begingroup$

Can you give examples of algorithms possessing the following two properties:
1. Solving a non-algebraic problem.
2. Relying on results in algebra.

For example, the paper http://people.csail.mit.edu/nickh/Publications/AlgebraicMatching/Algebraic-SIAM.pdf uses linear algebra to solve graph theoretic problems.

  • 0
    Do algorithms that operate over algebraic structures like groups, monoids, etc. count by your definition? Or do you only want things that directly rely on a result from algebra?2012-01-10

6 Answers 6