2766 search results - page 16 / 554 » Algorithms for trigonometric polynomials |
SODA
1993
ACM
13 years 9 months ago
1993
ACM
ISSAC
1998
Springer
14 years 21 days ago
1998
Springer
The subresultant theory for univariate commutative polynomials is generalized to Ore polynomials. The generalization includes: the subresultant theorem, gap structure, and subresu...
JOC
2007
13 years 8 months ago
2007
Abstract. We address one of the most fundamental problems concerning the RSA cryptosystem: does the knowledge of the RSA public and secret key-pair (e, d) yield the factorization o...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher ev...
JGO
2008
13 years 8 months ago
2008
Abstract. Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of s...