Related papers: Computational Complexity of Avalanches in the Kada…
We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…
We lay the foundations of a new theory for algorithms and computational complexity by parameterizing the instances of a computational problem as a moduli scheme. Considering the geometry of the scheme associated to 3-SAT, we separate P and…
A sufficiently damped iteration of the Kohn-Sham equations with the exact functional is proven to always converge to the true ground-state density, regardless of the initial density or the strength of electron correlation, for finite…
Finite energy pluripotential theory accommodates the variational theory of equations of complex Monge-Amp\`ere type arising in K\"ahler geometry. Recently it has been discovered that many of the potential spaces involved have a rich metric…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
Markov decision process over vector addition system with states (VASS MDP) is a finite state model combining non-deterministic and probabilistic behavior, augmented with non-negative integer counters that can be incremented or decremented…
We prove that SVP$_p$ is NP-hard to approximate within a factor of $2^{\log^{1 - \varepsilon} n}$, for all constants $\varepsilon > 0$ and $p > 2$, under standard deterministic Karp reductions. This result is also the first proof that…
The main goal of this paper is to show that shellability is NP-hard for triangulated d-balls (this also gives hardness for triangulated d-manifolds/d-pseudomanifolds with boundary) as soon as d is at least 3. This extends our earlier work…
We study sandpile models with stochastic toppling rules and having sticky grains so that with a non-zero probability no toppling occurs, even if the local height of pile exceeds the threshold value. Dissipation is introduced by adding a…
Mappings of classical computation onto statistical mechanics models have led to remarkable successes in addressing some complex computational problems. However, such mappings display thermodynamic phase transitions that may prevent reaching…
We consider linear regression problems with a varying number of random projections, where we provably exhibit a double descent curve for a fixed prediction problem, with a high-dimensional analysis based on random matrix theory. We first…
We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic quantum computation using a one-dimensional quantum system (with…
This article (II) continues the research described in [Morzhin O.V. Gradient projection method and stochastic search for some optimal control models with spin chains. I (submitted)] (Article I), derives the needed finite-dimensional…
We prove that integer programming with three quantifier alternations is $NP$-complete, even for a fixed number of variables. This complements earlier results by Lenstra and Kannan, which together say that integer programming with at most…
We study the computational complexity of the infinite-horizon discounted-reward Markov Decision Problem (MDP) with a finite state space $|\mathcal{S}|$ and a finite action space $|\mathcal{A}|$. We show that any randomized algorithm needs a…
There has been a great of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the validity problem for all logics between K, T, and S4 is {\sl…
A Constraint Satisfaction Problem (CSP) is a computational problem where we are given variables and constraints about them; the question is whether the variables can be assigned values such that all constraints are satisfied. We give an…
Packing problems are an important class of optimization problems. The probably most well-known problem if this type is knapsack and many generalizations of it have been studied in the literature like Two-dimensional Geometric Knapsack…
The KP equation is perhaps the most famous example of a three-dimensional integrable system. Here we show that a non-commutative five-dimensional Chern-Simons theory living on the projective spinor bundle of three-dimensional space-time…
The constraint satisfaction problem (CSP) involves deciding, given a set of variables and a set of constraints on the variables, whether or not there is an assignment to the variables satisfying all of the constraints. One formulation of…