An independent set of variables is one in which no two variables occur in the same clause in a given instance of k-SAT. Instances of k-SAT with an independent set of size i can be solved in time, within a polynomial factor of 2. In this paper, we present an algorithm for k-SAT based on a modification of the Satisfiability Coding Lemma. Our algorithm runs within a polynomial factor of 2 1 2k−2 ,...

We propose a novel family of polynomial-based local search algorithms for MAX-CSP. From this family, we present an optimal, fast algorithm, called Evergreen local search (ELS). We evaluate ELS as a preprocessor for state-of-the-art MAX-CSP and MAX-SAT solvers which shows promising improvement in speed and quality.

We study algorithms based on local improvements for the k-Set Packing problem. The well-known local improvement algorithm by Hurkens and Schrijver [13] has been improved by Sviridenko and Ward [14] from k 2 + to k+2 3 , and by Cygan [7] to k+1 3 + for any > 0. In this paper, we achieve the approximation ratio k+1 3 + for the k-Set Packing problem using a simple polynomial-time algorithm based o...

We propose two local consistencies that extend bounds consistency (BC) by simultaneously considering combinations of constraints as opposed to single constraints. We prove that these two local consistencies are both stronger than BC, but are NP-hard to enforce even when constraints are linear. Hence, we propose two polynomial-time techniques to enforce approximations of these two consistencies ...

today, online social networks are very popular due to the possibility of creating relationships between people all over the world. these social networks with possibilities such as friend recommendation generally use local features derived from social graph structure. for friend recommendation, there are different algorithms with local and global approaches. in this paper, we proposed an algorit...

A separable assignment problem (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, fij , for assigning item j to bin i; and a separate packing constraint for each bin—i.e., for each bin, a family of subsets of items that fit in to that bin. The goal is to pack items into bins to maximize the aggregate value. This class of problems includes the maximum generalized ...

We propose a symbolic computation algorithm for computing local parametrization of analytic branches and real analytic branches of a curve in n-dimensional space, which is de ned by implicit polynomial equations. The algorithm can be used in space curve tracing near a singular point, as an alternative to symbolic computations based on resolutions of singularities.

We present a new algorithm to approximate real roots of multivariate polynomial systems. This algorithm combines the standard subdivision technique with a new domain reduction strategy. We introduce fat spheres as multidimensional quadratic enclosures for algebraic hypersurfaces. Then we present a local reformulation technique of the algebraic system, which provides a method to generate fat sph...

Lüscher’s local bosonic algorithm for Monte Carlo simulations of quantum field theories with fermions is applied to the simulation of a possibly supersymmetric Yang-Mills theory with a Majorana fermion in the adjoint representation. Combined with a correction step in a two-step polynomial approximation scheme, the obtained algorithm seems to be promising and could be competitive with more conve...