2766 search results - page 57 / 554 » Algorithms for trigonometric polynomials |
70
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
In this paper, we investigate the efficiency of various strategies for subdividing polynomial triangular surface patches. We give a simple algorithm performing a regular subdivisio...
109
click to vote
STOC
2002
ACM
16 years 1 months ago
2002
ACM
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant ? > 0 such that if there is some l...
106
Voted
EUROCRYPT
2004
Springer
15 years 6 months ago
2004
Springer
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
JC
2006
15 years 20 days ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
BIRTHDAY
2009
Springer
15 years 7 months ago
2009
Springer
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...