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.