2766 search results - page 72 / 554 » Algorithms for trigonometric polynomials |
TCS
2008
15 years 20 days ago
2008
In this paper we survey several recent results that highlight an interplay between a relatively new class of quasiseparable matrices and polynomials. Quasiseparable matrices gener...
93
Voted
MOC
2002
15 years 13 days ago
2002
This paper presents an average time analysis of a Hensel lifting based factorisation algorithm for bivariate polynomials over finite fields. It is shown that the average running ti...
71
Voted
MOC
1998
15 years 13 days ago
1998
Abstract. We describe several searches for polynomials with integer coefficients and small Mahler measure. We describe the algorithm used to test Mahler measures. We determine all...
120
click to vote
STACS
2009
Springer
15 years 7 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
95
Voted
ISSAC
1997
Springer
15 years 4 months ago
1997
Springer
We give a new numerical absolute primality criterion for bivariate polynomials. This test is based on a simple property of the monomials appearing after a generic linear change of...