Related papers: A note on polynomial solvability of the CDT proble…
We proposed an algorithm that covers some cases of Hamilton Circuit Problem.
We extend the knowledge about so-called structural restrictions of $\mathrm{\#SAT}$ by giving a polynomial time algorithm for $\beta$-acyclic $\mathrm{\#SAT}$. In contrast to previous algorithms in the area, our algorithm does not proceed…
In this paper we show that every combinatorial problem has an exact explicit equation that returns its solution. We present a method to obtain an equation that solves exactly any combinatorial problem, both inversion, constraint…
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…
The Burer-Monteiro method is one of the most widely used techniques for solving large-scale semidefinite programs (SDP). The basic idea is to solve a nonconvex program in $Y$, where $Y$ is an $n \times p$ matrix such that $X = Y Y^T$. In…
Simple temporal problems represent a powerful class of models capable of describing the temporal relations between events that arise in many real-world applications such as logistics, robot planning and management systems. The classic…
One of the driving problems in the CSP area is the Dichotomy Conjecture, formulated in 1993 by Feder and Vardi [STOC'93], stating that for any fixed relational structure G the Constraint Satisfaction Problem CSP(G) is either NP--complete or…
We consider a class of fixed-charge transportation problems over graphs. We show that this problem is strongly NP-hard, but solvable in pseudo-polynomial time over trees using dynamic programming. We also show that the LP formulation…
The Unbounded Subset-Sum Problem (USSP) is defined as: given sum $s$ and a set of integers $W\leftarrow \{p_1,\dots,p_n\}$ output a set of non-negative integers $\{y_1,\dots,y_n\}$ such that $p_1y_1+\dots+p_ny_n=s$. The USSP is an…
In recent years, there has been increasing interest in explanation methods for neural model predictions that offer precise formal guarantees. These include abductive (respectively, contrastive) methods, which aim to compute minimal subsets…
This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…
A randomized algorithm for a search problem is *pseudodeterministic* if it produces a fixed canonical solution to the search problem with high probability. In their seminal work on the topic, Gat and Goldwasser posed as their main open…
Finding diverse solutions in combinatorial problems recently has received considerable attention (Baste et al. 2020; Fomin et al. 2020; Hanaka et al. 2021). In this paper we study the following type of problems: given an integer $k$, the…
A Parity-Time (PT)-symmetric system with periodically varying-in-time gain and loss modeled by two coupled Schrodinger equations (dimer) is studied. It is shown that the problem can be reduced to a perturbed pendulum-like equation. This is…
The article presents the theoretical background of the algorithms for solving cyclic block tridiagonal and cyclic block penta-diagonal systems of linear algebraic equations present in ref [1] and [2]. The theory is based on the Woodbury…
In this paper, we prove that no deterministic algorithm can solve SAT in polynomial time in the number of boolean variables.
We present a practical algorithm based on symplectic splitting methods to integrate numerically in time the Schr\"odinger equation. When discretized in space, the Schr\"odinger equation can be recast as a classical Hamiltonian system…
Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take…
Based on the Bezout approach we propose a simple algorithm to determine the {\tt gcd} of two polynomials which doesn't need division, like the Euclidean algorithm, or determinant calculations, like the Sylvester matrix algorithm. The…