Complexity bound of absolute factoring of parametric polynomials.
Zapiski Nauchnykh Seminarov POMI (2004)
- Volume: 316, page 5-29
- ISSN: 0373-2703
Access Full Article
top
How to cite
topAyad, A.. "Complexity bound of absolute factoring of parametric polynomials.." Zapiski Nauchnykh Seminarov POMI 316 (2004): 5-29. <http://eudml.org/doc/223274>.
@article{Ayad2004,
author = {Ayad, A.},
journal = {Zapiski Nauchnykh Seminarov POMI},
keywords = {parametric polynomial; parameter space; absolute irreducible polynomial; Hensel lemma; quantifier elimination; complexity bound; factorization; algorithm},
language = {eng},
pages = {5-29},
publisher = {Nauka},
title = {Complexity bound of absolute factoring of parametric polynomials.},
url = {http://eudml.org/doc/223274},
volume = {316},
year = {2004},
}
TY - JOUR
AU - Ayad, A.
TI - Complexity bound of absolute factoring of parametric polynomials.
JO - Zapiski Nauchnykh Seminarov POMI
PY - 2004
PB - Nauka
VL - 316
SP - 5
EP - 29
LA - eng
KW - parametric polynomial; parameter space; absolute irreducible polynomial; Hensel lemma; quantifier elimination; complexity bound; factorization; algorithm
UR - http://eudml.org/doc/223274
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.