We analyze the efficiency of the random walk algorithm on random -CNF instances, and prove the first polynomial time upper bound for small clause density, less than . We complement this by proving exponential lower bounds for the running time of this algorithm on the planted-SAT distribution with large constant clause density. This is the first polynomial upper bound on the running time of a lo...

We present an exact local bosonic algorithm for the simulation of dynamical fermions in lattice QCD. It is based on a non-hermitian polynomial approximation of the inverse of the quark matrix and a global Metropolis accept/reject correction of the systematic errors. We show that this algorithm is a real alternative to the Hybrid Monte Carlo algorithm.

Let k be a field of characteristic 0. Given a polynomial mapping f = (f1, . . . , fp) from kn to kp, the local Bernstein–Sato ideal of f at a point a ∈ kn is defined as an ideal of the ring of polynomials in s = (s1, . . . , sp). We propose an algorithm for computing local Bernstein–Sato ideals by combining Gröbner bases in rings of differential operators with primary decomposition in a polynom...