Abstract. We describe several searches for polynomials with integer coefficients and small Mahler measure. We describe the algorithm used to test Mahler measures. We determine all...
Although propositional satisfiability (SAT) is NP-complete, state-of-the-art SAT solvers are able to solve large, practical instances. The concept of backdoors has been introduced...
Abstract. This paper presents a simple and practical solution to the 6-point 2view focal-length estimation problem. Based on the hidden-variable technique we have derived a 15th de...
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...