MEEK 发表于 2025-4-1 02:58:48

Polynomial Complexity of Solving Systems of Few Algebraic Equations with Small Degrees,An algorithm is designed which tests solvability of a system of . polynomial equations in . variables with degrees . within complexity polynomial in .. If the system is solvable then the algorithm yields one of its solutions. Thus, for fixed ., . the complexity of the algorithm is polynomial.
页: 1 2 3 4 5 6 [7]
查看完整版本: Titlebook: Computer Algebra in Scientific Computing; 15th International W Vladimir P. Gerdt,Wolfram Koepf,Evgenii V. Vorozht Conference proceedings 20