Nonlinear Algebra and Optimization on Rings are “Hard”

DOI10.1137/0216059zbMath0686.68037OpenAlexW1971821372MaRDI QIDQ4205079

Richard E. Stearns, Harry B. III Hunt

Publication date: 1987

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0216059

zbMATH Keywords

computational complexityNP-completenessalgebraic computationnonlinear optimizations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) General commutative ring theory (13A99) Generalizations (16Y99)

Related Items

Power indices and easier hard problems ⋮ The complexity of equivalence for commutative rings