Kleene chain completeness and fixedpoint properties |
| |
Authors: | Tsutomu Kamimura Adrian Tang |
| |
Affiliation: | Department of Computer Science, University of Kansas, Lawrence, KS 66045, U.S.A. |
| |
Abstract: | Let L denote the nonscalar complexity in k(x1,…, xn). We prove . Using this we determine the complexity of single power sums, single elementary symmetric functions, the resultant and the discriminant as root functions, up to order of magnitude. Also we linearly reduce matrix inversion to computing the determinant. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|