Let’s make a big list of algorithms relying on abstract algebra. This will help us see how ubiquitous algebra is in algorithm design. I’ll start with two: one is the General Number Field Sieve, the other is Babai’s graph isomorphism algorithm.
$\begingroup$
$\endgroup$
3
-
$\begingroup$ Many decoding and list decoding algorithms in coding theory come to mind. Also primality testing, factoring polynomials and discrete logarithm. $\endgroup$Yuval Filmus– Yuval Filmus2020-09-13 09:27:00 +00:00Commented Sep 13, 2020 at 9:27
-
1$\begingroup$ "Let's make a big list" questions are usually too broad to be a good fit here. Any community votes? $\endgroup$D.W.– D.W. ♦2020-09-13 18:45:39 +00:00Commented Sep 13, 2020 at 18:45
-
$\begingroup$ When proposing a "big list" question, one thing that would help is to motivate why you are interested in examples of this. If that is well-explained then it could be more useful. If you just say "Let's make a big list" it's hard to argue that it's a good question for the site. $\endgroup$Caleb Stanford– Caleb Stanford2020-09-17 14:52:59 +00:00Commented Sep 17, 2020 at 14:52
Add a comment
|