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 ...
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...
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...