Proving geometric algorithm non-solvability: An application of factoring polynomials
- 1 March 1986
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 2 (1) , 99-102
- https://doi.org/10.1016/s0747-7171(86)80015-3
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- The algebraic degree of geometric optimization problemsDiscrete & Computational Geometry, 1988
- Memoir on the Substitution-Groups Whose Degree Does not Exceed EightAmerican Journal of Mathematics, 1899