Approximate solutions of polynomial equations. (Q1599546)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Approximate solutions of polynomial equations.	scientific article

Statements

scholarly article

0 references

Approximate solutions of polynomial equations. (English)

0 references

0 references

Journal of Symbolic Computation

0 references

publication date

11 June 2002

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1006/jsco.2001.0505

0 references

On the computational power of pushdown automata

0 references

Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time

0 references

0 references

Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization

0 references

Factoring multivariate integral polynomials

0 references

Factoring Multivariate Polynomials over Algebraic Number Fields

0 references

Factoring polynomials with rational coefficients

0 references

0 references

0 references

Computational complexities of diophantine equations with parameters

0 references

Identifiers

zbMATH Open document ID

0 references

10.1006/jsco.2001.0505

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1599546

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1599546&oldid=34301677"