Using Galois Theory to Prove Structure from Motion Algorithms are Optimal
This 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 e
|Collections||ANU Research Publications|
|Source:||Proceedings of the Computer Vision and Pattern Recognition Conference (CVPR 2007)|
|01_Nister_Using_Galois_Theory_to_Prove_2007.pdf||213.37 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.