Related papers: The Well Structured Problem for Presburger Counter…
Second-order formulations of the 3+1 Einstein equations obtained by eliminating the extrinsic curvature in terms of the time derivative of the metric are examined with the aim of establishing whether they are well posed, in cases of…
We present explicit algorithms for computing structured matrix-vector products that are optimal in the sense of Strassen, i.e., using a provably minimum number of multiplications. These structures include Toeplitz/Hankel/circulant,…
We consider the bin packing problem with $d$ different item sizes and revisit the structure theorem given by Goemans and Rothvo\ss [6] about solutions of the integer cone. We present new techniques on how solutions can be modified and give…
We study a type of reverse (procurement) auction problems in the presence of budget constraints. The general algorithmic problem is to purchase a set of resources, which come at a cost, so as not to exceed a given budget and at the same…
Negatively answering a question posed by Mnich and Wiese (Math. Program. 154(1-2):533-562), we show that P2|prec,$p_j{\in}\{1,2\}$|$C_{\max}$, the problem of finding a non-preemptive minimum-makespan schedule for precedence-constrained jobs…
We give a quantifier elimination procedures for the extension of Presburger arithmetic with a unary threshold counting quantifier $\exists^{\ge c} y$ that determines whether the number of different $y$ satisfying some formula is at least $c…
We investigate the parameterised complexity of the classic coverability problem for vector addition systems (VAS): given a finite set of vectors $V \subseteq\mathbb{Z}^d$, an initial configuration $s\in\mathbb{N}^d$, and a target…
Structured prediction plays a central role in machine learning applications from computational biology to computer vision. These models require significantly more computation than unstructured models, and, in many applications, algorithms…
There is a tendency to write the equations of general relativity as a first order symmetric system of time dependent partial differential equations. However, for numerical reasons, it might be advantageous to use a second order formulation…
This paper approaches, using structural complexity theory, the question of whether there is a chasm between knowing an object exists and getting one's hands on the object or its properties. In particular, we study the nontransparency of…
We consider the problem of counting the number of possible sets of rankings (called ranking patterns) generated by unfolding models of codimension one. We express the ranking patterns as slices of the braid arrangement and show that all…
Structured variational inference constitutes a core methodology in modern statistical applications. Unlike mean-field variational inference, the approximate posterior is assumed to have interdependent structure. We consider the natural…
In this work we consider a generalization of the well-studied problem of coding for ``stuck-at'' errors, which we refer to as ``strong stuck-at'' codes. In the traditional framework of stuck-at codes, the task involves encoding a message…
We investigate the complexity of the containment problem "Does $L(A)\subseteq L(B)$ hold?", where $B$ is an unambiguous register automaton and $A$ is an arbitrary register automaton. We prove that the problem is decidable and give upper…
In robust combinatorial optimization, we would like to find a solution that performs well under all realizations of an uncertainty set of possible parameter values. How we model this uncertainty set has a decisive influence on the…
We investigate refined algebraic quantisation within a family of classically equivalent constrained Hamiltonian systems that are related to each other by rescaling a momentum-type constraint. The quantum constraint is implemented by a…
We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…
We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…
We solve a long-standing problem by enumerating the number of non-degenerate Desargues configurations. We extend the result to the more difficult case involving Desargues blockline structures in Section 8. A transparent proof of Desargues…
This is a companion note to Zinde-Walsh (2010), arXiv:1009.4217v1[MATH.ST], to clarify and extend results on identification in a number of problems that lead to a system of convolution equations. Examples include identification of the…