2 citations · 3 across the 10 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
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…
math.AG2016
Places, cuts and orderings of function fields
Przemysław Koprowski, Katarzyna Kuhlmann
In this paper we investigate the space of -places of an algebraic function field of one variable. We deal with the problem of determining when two orderings of such a f…