For the last 4000 years, solving equations has been
a central problem in algebra. In finite algebraic structures, so-
lutions can be found by testing all possible candidates. Often,
however, more efficient methods are available: syntactic methods
(manipulating the equations) or semantic methods (limiting the
candidates).
We will give some recent results on the complexity of solving
equations and discuss the relation to other computational prob-
lems.