相关论文: Knuth-Bendix constraint solving is NP-complete
The classical method to solve a quadratic optimization problem with nonlinear equality constraints is to solve the Karush-Kuhn-Tucker (KKT) optimality conditions using Newton's method. This approach however is usually computationally…
For an indeterminate Hamburger moment problem we consider an infinite family of analytic densities solving the moment problem and we prove that they all have finite (Shannon) entropy. These densities are either all bounded or all unbounded.…
We present a CLP(FD)-based constraint solver able to deal with unbounded domains. It is based on constraint propagation, resorting to enumeration if all other methods fail. An important aspect is detecting when enumeration was complete and…
Given a convex set $Q \subseteq R^m$ and an integer matrix $W \in Z^{m \times n}$, we consider statements of the form $ \forall b \in Q \cap Z^m$ $\exists x \in Z^n$ s.t. $Wx \leq b$. Such statements can be verified in polynomial time with…
We introduce the idea that the P vs NP problem can have a finer structure. Given the NP complete problem of interest, the configurations space of the problem can be divided in (at least) two regions. In one region, polynomial algorithms to…
When solving the Hamiltonian path problem it seems natural to be given additional precedence constraints for the order in which the vertices are visited. For example one could decide whether a Hamiltonian path exists for a fixed starting…
In this paper two algorithms solving circuit satisfiability problem over supernilpotent algebras are presented. The first one is deterministic and is faster than fastest previous algorithm presented by Aichinger. The second one is…
In this paper, we study a matricial version of the Byrnes-Georgiou-Lindquist generalized moment problem with complexity constraint. We introduce a new metric on multivariable spectral densities induced by the family of their spectral…
Probabilistic argumentation allows reasoning about argumentation problems in a way that is well-founded by probability theory. However, in practice, this approach can be severely limited by the fact that probabilities are defined by adding…
This paper deals with the problem of finding, for a given graph and a given natural number k, a subgraph of k nodes with a maximum number of edges. This problem is known as the k-cluster problem and it is NP-hard on general graphs as well…
The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.…
We now set up Constraint Closure in a manner consistent with Temporal and Configurational Relationalism. This requires modifying the Dirac Algorithm - which addresses the Constraint Closure Problem facet of the Problem of Time piecemeal -…
Equational theories that contain axioms expressing associativity and commutativity (AC) of certain operators are ubiquitous. Theorem proving methods in such theories rely on well-founded orders that are compatible with the AC axioms. In…
We propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a linear program with complementarity constraints in order to…
Quantum computing is seeking to realize hardware-optimized algorithms for application-related computational tasks. NP (nondeterministic-polynomial-time) is a complexity class containing many important but intractable problems like the…
Over the last years the vertex enumeration problem of polyhedra has seen a revival in the study of metabolic networks, which increased the demand for efficient vertex enumeration algorithms for high-dimensional polyhedra given by…
We relate the decidability problem for BS with unordered cartesian product with Hilbert's Tenth problem and prove that BS with unordered cartesian product is NP-complete.
We first show that infinite satisfiability can be reduced to finite satisfiability for all prenex formulas of Separation Logic with $k\geq1$ selector fields ($\seplogk{k}$). Second, we show that this entails the decidability of the finite…
We study a family of (potentially non-convex) constrained optimization problems with convex composite structure. Through a novel analysis of non-smooth geometry, we show that proximal-type algorithms applied to exact penalty formulations of…
We propose to classify the power of algorithms by the complexity of the problems that they can be used to solve. Instead of restricting to the problem a particular algorithm was designed to solve explicitly, however, we include problems…