相关论文: Reducing SAT to 2-SAT

The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…

In this paper, we address the problem of reconstruction of support of a measure from its moments. More precisely, given a finite subset of the moments of a measure, we develop a semidefinite program for approximating the support of measure…

In this paper, a single sum formula for the linearization coefficients of the Bessel polynomials is given. In three special cases this formula reduces indeed to either Atia and Zeng's formula (Ramanujan Journal, Doi…

The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.

In this article, we consider a collection of geometric problems involving points colored by two colors (red and blue), referred to as bichromatic problems. The motivation behind studying these problems is two fold; (i) these problems appear…

We consider the problem of finding and enumerating polyominos that can be folded into multiple non-isomorphic boxes. While several computational approaches have been proposed, including SAT, randomized algorithms, and decision diagrams,…

We show that, under reasonable assumptions, two negative roots can be eliminated from the characteristic equation of a polynomial-like iterative equation. This result gives a new case where we may lower the order of such an equation.

We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…

Recently, we presented a new Two-Bar Charts Packing Problem (2-BCPP), in which it is necessary to pack two-bar charts (2-BCs) in a unit-height strip of minimum length. The problem is a generalization of the Bin Packing Problem and 2-D…

In the article, within the framework of the Boolean Satisfiability problem (SAT), the problem of estimating the hardness of specific Boolean formulas w.r.t. a specific complete SAT solving algorithm is considered. Based on the well-known…

We give the classification, up to homeomorphisms, of reduced complex polynomials with 2 variables with one critical value.

The aim of this paper is to introduce Bell polynomials and numbers of the second kind and poly-Bell polynomials and numbers of the second kind, and to derive their explicit expressions, recurrence relations and some identities involving…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

We present an online method for estimating the cost of solving SAT problems. Modern SAT solvers present several challenges to estimate search cost including non-chronological backtracking, learning and restarts. Our method uses a linear…

This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…

This paper studies bilevel polynomial optimization problems. To solve them, we give a method based on polynomial optimization relaxations. Each relaxation is obtained from the Kurash-Kuhn-Tucker (KKT) conditions for the lower level…

We present a hierarchy of tractable relaxations to obtain lower bounds on the minimum value of a polynomial over a constraint set defined by polynomial equations. In contrast to previous convex relaxation techniques for this problem, our…

All solutions SAT (AllSAT for short) is a variant of propositional satisfiability problem. Despite its significance, AllSAT has been relatively unexplored compared to other variants. We thus survey and discuss major techniques of AllSAT…

We consider the problem of minimal correction of the training set to make it consistent with monotonic constraints. This problem arises during analysis of data sets via techniques that require monotone data. We show that this problem is…

We determine reductions of 2-dimensional, irreducible, semi-stable, and non-crystalline representations of $\mathrm{Gal}(\overline{\mathbb Q}_p/\mathbb Q_p)$ with Hodge--Tate weights $0 < k-1$ and with $\mathcal L$-invariant whose $p$-adic…