Nonlinear Algebra and Optimization on Rings are “Hard”
- 1 October 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 16 (5) , 910-929
- https://doi.org/10.1137/0216059
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Nonlinear Algebra and Optimization on Rings are “Hard”SIAM Journal on Computing, 1987
- Monotone boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures (preliminary report)Published by Springer Nature ,1985
- Algebraic Structures with Hard Equivalence and Minimization ProblemsJournal of the ACM, 1984
- Probabilistic Algorithms for Deciding Equivalence of Straight-Line ProgramsJournal of the ACM, 1983
- Complexity of problems in games, graphs and algebraic equationsDiscrete Applied Mathematics, 1979
- The complexity of satisfiability problemsPublished by Association for Computing Machinery (ACM) ,1978
- On the difference between one and manyPublished by Springer Nature ,1977
- Computational complexity of decision procedures for polynomialsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Computationally Related ProblemsSIAM Journal on Computing, 1974
- There Cannot be any Algorithm for Integer Programming with Quadratic ConstraintsOperations Research, 1973