Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures

DOI10.1145/384101.384126zbMath1356.68279OpenAlexW2001690162MaRDI QIDQ2958929

Richard E. Stearns, Harry B. III Hunt, Madhav V. Marathe

Publication date: 3 February 2017

Published in: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://www.osti.gov/biblio/975118

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Related Items (2)

Unnamed Item ⋮ Predecessor existence problems for finite discrete dynamical systems

This page was built for publication: Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures