Using Galois Theory to Prove Structure from Motion Algorithms are Optimal

Nister, DavidHartley, RichardStewenius, Henrik2015-12-10June 18-231424411807http://hdl.handle.net/1885/39252This paper presents a general method, based on Galois Theory, for establishing that a problem can not be solved by a ′machine ′ that is capable of the standard arithmetic operations, extraction of radicals (that is, m-th roots for any m), as well as eKeywords: Numerical methods; Polynomials; Problem solving; Arithmetic operations; Galois Theory; Motion algorithms; Motion compensationUsing Galois Theory to Prove Structure from Motion Algorithms are Optimal200710.1109/CVPR.2007.3830892015-12-09