We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemi...
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...