2766 search results - page 9 / 554 » Algorithms for trigonometric polynomials |
COCO
2008
Springer
15 years 1 months ago
2008
Springer
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant
108
click to vote
STACS
2009
Springer
15 years 4 months ago
2009
Springer
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...
173
click to vote
ISSAC
2011
Springer
14 years 2 months ago
2011
Springer
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
SODA
2012
ACM
13 years 2 months ago
2012
ACM
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
STOC
2010
ACM
2010
ACM
Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem
15 years 4 months ago
