An algorithm for finding distinguished chains of polynomials.
Acta Universitatis Apulensis. Mathematics - Informatics (2003)
- Volume: 5, page 115-126
- ISSN: 1582-5329
Access Full Article
top
How to cite
topZaharescu, Alexandru. "An algorithm for finding distinguished chains of polynomials.." Acta Universitatis Apulensis. Mathematics - Informatics 5 (2003): 115-126. <http://eudml.org/doc/126418>.
@article{Zaharescu2003,
author = {Zaharescu, Alexandru},
journal = {Acta Universitatis Apulensis. Mathematics - Informatics},
keywords = {irreducible polynomials saturated distinguished chains; local fields},
language = {eng},
pages = {115-126},
publisher = {"1 Decembrie 1918" University of Alba Iulia, Department of Mathematics and Informatics},
title = {An algorithm for finding distinguished chains of polynomials.},
url = {http://eudml.org/doc/126418},
volume = {5},
year = {2003},
}
TY - JOUR
AU - Zaharescu, Alexandru
TI - An algorithm for finding distinguished chains of polynomials.
JO - Acta Universitatis Apulensis. Mathematics - Informatics
PY - 2003
PB - "1 Decembrie 1918" University of Alba Iulia, Department of Mathematics and Informatics
VL - 5
SP - 115
EP - 126
LA - eng
KW - irreducible polynomials saturated distinguished chains; local fields
UR - http://eudml.org/doc/126418
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.