scientific article
From MaRDI portal
Publication:3668871
zbMath0519.68059MaRDI QIDQ3668871
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveycomputational complexityirreducible polynomialsHensel's lemmafactorization algorithmsalgebraic computation
Analysis of algorithms and problem complexity (68Q25) Polynomials over commutative rings (13B25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to commutative algebra (13-02)
Related Items
Some examples for solving systems of algebraic equations by calculating Gröbner bases, Application of the MuMATH(R) symbol manipulation system to chemically significant permutation groups, Factoring multivariate integral polynomials, Computer algebra: Past and future, An improved projection operation for cylindrical algebraic decomposition of three-dimensional space, An adjacency algorithm for cylindrical algebraic decompositions of three- dimensional space, An efficient algorithm for factoring polynomials over algebraic extension field, Univariate polynomial factorization over finite fields, Fast separable factorization and applications, Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators, Improved dense multivariate polynomial factorization algorithms, Approximate GCD and its application to ill-conditioned algebraic equations, Implicit representation of rational parametric surfaces, Validity proof of Lazard's method for CAD construction, Factoring polynomials over finite fields: A survey, New recombination algorithms for bivariate polynomial factorization based on Hensel lifting, Complexity of solving parametric polynomial systems, Factoring polynomials and the knapsack problem, Theory of computational complexity. Part 9. Transl. from the Russian., A hierarchy of generalized invariants for linear partial differential operators, Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems, Fast Hensel's lifting implementation using partial fraction decomposition
