Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures
Harry B. Hunt, MADHAV V. MARATHE, Richard Edwin Stearns · 2001
We demonstrate how the concepts of algebraic representability and strongly-local reductions developed here and in [20] can be used to characterize the computational complexity/efficient approximability of a number of basic problems and their variants, on various abstract algebraic structures F. These problems include the following: