Computational Complexity of Algebraic Functions
暂无分享,去创建一个
Abstract We consider algebraic functions that are rational functions of roots (of various degrees) of rational functions of indeterminates. We associate a cost C(d) with the extraction of a dth root and assume that C satisfies certain natural axioms. We show that the minimum cost of computing a finite set of algebraic functions of the form considered is C(d 1 ) + … + C(d r ) , where d 1 … d r are the torsion orders of the Galois group of the extension generated by the functions.
[1] G Yuval,et al. The Mean Distance in 2-Space, , 1976 .
[2] Nicholas Pippenger,et al. Computational complexity in algebraic function fields , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[3] Michael Ian Shamos,et al. Lower bounds from complex function theory , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).