1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.SC2023
Factorization and root-finding for polynomials over division quaternion algebras
Przemysław Koprowski
Polynomial factorization and root finding are among the most standard themes of computational mathematics. Yet still, little has been done for polynomials over quaternion algebras,…
cs.SC2023
Pourchet's theorem in action: decomposing univariate nonnegative polynomials as sums of five squares
Victor Magron, Przemysław Koprowski, Tristan Vaccon
Pourchet proved in 1971 that every nonnegative univariate polynomial with rational coefficients is a sum of five or fewer squares. Nonetheless, there are no known algorithms for co…
cs.SC2016★ 1 cited
A note about "Faster algorithms for computing Hong's bound on absolute positiveness" by K. Mehlhorn and S. Ray
Przemysław Koprowski
We show that a linear-time algorithm for computing Hong's bound for positive roots of a univariate polynomial, described by K. Mehlhorn and S. Ray in an article "Faster algorithms…