Advanced search

Browse by subject

Browse by provider

Browse by language

Content Details
Normal View
CIP View

Computing the bound of an Ore polynomial...

Gomez-Torrecillas, J...

Free

Share this content

Computing the bound of an Ore polynomial. Applications to factorization by Gomez-Torrecillas, Jose ( Author )

Content Provider	Lemonjar Open Access
Publisher	Australian National University
Publication Date	25-08-2023
Summary	We develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a factorization algorithm. The asymptotic time complexity in the degree of the given Ore polynomial is studied. In the class of Ore polynomials over a finite field, our algorithm is an alternative to Giesbretch's one that reduces the complexity in the degree of the polynomial.
ISBN	-
Item Type	Article
File Type	pdf
File Size	29.34 KB
Language	English
Subjects	-
Unlimited	MYR 0.01
Total read	-
URL	http://arxiv.org/abs/1307.5529

Citation

Review the full bibliography data and make any necessary corrections before using. Always consult your library resources for the exact formatting and punctuation guidelines.

AMA 11th EditionReferences

Gomez-Torrecillas, Jose. Computing the bound of an Ore polynomial. Applications to factorization. Australian National University. August 25, 2023. Accessed August 08, 2025. https://online.provdatabase.com/cite/21012

APA 7th EditionReferences

Gomez-Torrecillas, Jose. (2023). Computing the bound of an Ore polynomial. Applications to factorization. Australian National University. https://online.provdatabase.com/cite/21012

Chicago 17th EditionReferences

Gomez-Torrecillas, Jose. Computing the bound of an Ore polynomial. Applications to factorization. Australian National University. 2023. https://online.provdatabase.com/cite/21012

HarvardReferences

Gomez-Torrecillas, Jose. (2023). Computing the bound of an Ore polynomial. Applications to factorization. [Online]. Australian National University. Available from: https://online.provdatabase.com/cite/21012. (Accessed 08 August 2025).

Harvard AustraliaReferences

Gomez-Torrecillas, Jose, 2023, Computing the bound of an Ore polynomial. Applications to factorization, Australian National University, viewed 08 August 2025, <https://online.provdatabase.com/cite/21012>

MLA 9th EditionWorks Cited

Gomez-Torrecillas, Jose. Computing the bound of an Ore polynomial. Applications to factorization. Australian National University, 2023. PROV Database, https://online.provdatabase.com/cite/21012.

Share this eBook