Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to...
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
This paper provides a fast and accurate randomization algorithm for valuing American puts and calls on dividend-paying stocks and their early exercise boundaries. The primal focus...
— We consider the design of a sensor network for detecting an emitter who if present is known to be located in an interval but whose exact position is unknown. We seek to minimiz...