scientific article; zbMATH DE number 3823145
From MaRDI portal
Publication:3668871
zbMATH Open0519.68059MaRDI QIDQ3668871FDOQ3668871
Authors: Erich L. Kaltofen 
Publication date: 1982
Title of this publication is not available (Why is that?)
surveycomputational complexityirreducible polynomialsfactorization algorithmsHensel's lemmaalgebraic computation
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Polynomials over commutative rings (13B25) Research exposition (monographs, survey articles) pertaining to commutative algebra (13-02)
Cited In (23)
- Validity proof of Lazard's method for CAD construction
- Some examples for solving systems of algebraic equations by calculating Gröbner bases
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems
- Approximate GCD and its application to ill-conditioned algebraic equations
- An adjacency algorithm for cylindrical algebraic decompositions of three- dimensional space
- Implicit representation of rational parametric surfaces
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Univariate polynomial factorization over finite fields
- Factoring polynomials over finite fields: A survey
- Factoring multivariate integral polynomials
- An improved projection operation for cylindrical algebraic decomposition of three-dimensional space
- Complexity of solving parametric polynomial systems
- Computer algebra: Past and future
- Factoring polynomials and the knapsack problem
- A hierarchy of generalized invariants for linear partial differential operators
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- Improved dense multivariate polynomial factorization algorithms
- Theory of computational complexity. Part 9. Transl. from the Russian.
- An efficient algorithm for factoring polynomials over algebraic extension field
- Fast separable factorization and applications
- Using the interval-symbol method with zero rewriting to factor polynomials over algebraic number fields
- Fast Hensel's lifting implementation using partial fraction decomposition
- Application of the MuMATH(R) symbol manipulation system to chemically significant permutation groups
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3668871)
