Related papers: On algorithms for testing positivity of symmetric …
A right [left] locally testable language S is a language with the property that for some non negative integer k two words u and v in alphabet S are equal in the semi group if (1) the prefix and suffix of the words of length k coincide, (2)…
Positive linear programs (LP), also known as packing and covering linear programs, are an important class of problems that bridges computer science, operations research, and optimization. Despite the consistent efforts on this problem, all…
We investigate the question if quantum algorithms exist that compute the maximum of a set of conjugated elements of a given number field in quantum polynomial time. We will relate the existence of these algorithms for a certain family of…
The aim of this short note is to draw attention to a method by which the partition function and marginal probabilities for a certain class of random fields on complete graphs can be computed in polynomial time. This class includes Ising…
The solutions of the equation $f^{(p-1)} + f^p = h^p$ in the unknown function $f $over an algebraic function field of characteristic $p$ are very closely linked to the structure and factorisations of linear differential operators with…
In many applications, it makes sense to solve the least square problems with nonnegative constraints. In this article, we present a new multiplicative iteration that monotonically decreases the value of the nonnegative quadratic programming…
Let ${\mathbf P}$ be the class of polynomial-time decision problems and $\mathbf{NP}$ be the class of nondeterministic polynomial time decision problems. We prove the following: Theorem 3. The classes ${\mathbf P}$ and $\mathbf{NP}$ are…
We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of…
A linear map between matrix spaces is positive if it maps positive semidefinite matrices to positive semidefinite ones, and is called completely positive if all its ampliations are positive. In this article quantitative bounds on the…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
Popularity is an approach in mechanism design to find fair structures in a graph, based on the votes of the nodes. Popular matchings are the relaxation of stable matchings: given a graph G=(V,E) with strict preferences on the neighbors of…
Recently, M. Kompatscher proved that for each finite supernilpotent algebra $\mathbf{A}$ in a congruence modular variety, there is a polynomial time algorithm to solve polynomial equations over this algebra. Let $\mu$ be the maximal arity…
We study quadratic optimization with indicator variables and an M-matrix, i.e., a PSD matrix with non-positive off-diagonal entries, which arises directly in image segmentation and portfolio optimization with transaction costs, as well as a…
We compare algorithms for global optimization of polynomial functions in many variables. It is demonstrated that existing algebraic methods (Gr\"obner bases, resultants, homotopy methods) are dramatically outperformed by a relaxation…
We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…
We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…
This article is about polynomial maps with a certain symmetry and/or antisymmetry in their Jacobians, and whether the Jacobian Conjecture is satisfied for such maps, or whether it is sufficient to prove the Jacobian Conjecture for such…
Partial methods play an important role in formal methods and beyond. Recently such methods were developed for parity games, where polynomial-time partial solvers decide the winners of a subset of nodes. We investigate here how effective…
In this paper, we give an algorithm that finds an epsilon-approximate solution to a mixed integer quadratic programming (MIQP) problem. The algorithm runs in polynomial time if the rank of the quadratic function and the number of integer…