Related papers: Polytime reductions of AF-algebraic problems
We study algebraic complexity classes and their complete polynomials under \emph{homogeneous linear} projections, not just under the usual affine linear projections that were originally introduced by Valiant in 1979. These reductions are…
We study the algorithmic complexity of fair division problems with a focus on minimizing the number of queries needed to find an approximate solution with desired accuracy. We show for several classes of fair division problems that under…
This book is mainly an exposition of the author's works and his joint works with his former students on explicit representations of finite-dimensional simple Lie algebras, related partial differential equations, linear orthogonal algebraic…
Novel classes of dynamical systems are introduced, including many-body problems characterized by nonlinear equations of motion of Newtonian type ("acceleration equals forces") which determine the motion of points in the complex plane. These…
Nonconvex optimization problems with an L1-constraint are ubiquitous, and are found in many application domains including: optimal control of hybrid systems, machine learning and statistics, and operations research. This paper shows that…
Given a weighted, ordered query set $Q$ and a partition of $Q$ into classes, we study the problem of computing a minimum-cost decision tree that, given any query $q$ in $Q$, uses equality tests and less-than comparisons to determine the…
We consider the problem of constructing semisimple subalgebras of real (semi-) simple Lie algebras. We develop computational methods that help to deal with this problem. Our methods boil down to solving a set of polynomial equations. In…
In this paper we introduce a class of constraint logic programs such that their termination can be proved by using affine level mappings. We show that membership to this class is decidable in polynomial time.
Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…
We show that solving the Maurer-Cartan equations is, essentially, the same thing as performing the Hamiltonian reduction construction. In particular, any differential graded Lie algebra equipped with an even nondegenerate invariant bilinear…
Let $A$ be a simple algebra over a field $F$. Under a mild cardinality assumption on $F$, we determine the greatest possible dimension for an $F$-affine subspace of $A$ that is included in the group of units $A^\times$, and we describe the…
In subset selection we search for the best linear predictor that involves a small subset of variables. From a computational complexity viewpoint, subset selection is NP-hard and few classes are known to be solvable in polynomial time. Using…
An algebraic telic problem is a decision problem in $\textsf{NP}_\mathbb{R}$ formalizing finite-time reachability questions for one-dimensional dynamical systems. We prove that the existence of "natural" mapping reductions between algebraic…
The classical linear ordering problem seeks a single ranking representing a given preference matrix. While suitable for homogeneous populations, it fails when observed preferences arise from several latent groups with distinct ranking…
We introduce analogues of algebraic groups called algebraic racks, which are pointed rack objects in the category of schemes over a ground field. Addressing a problem of Loday, we construct functors assigning left and right Leibniz algebras…
Reductions of N-wave type equations related to simple Lie algebras and the hierarchy of their Hamiltonian structures are studied. The reduction group G_R is realized as a subgroup of the Weyl group of the corresponding algebra. Some of the…
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…
Deciding the amalgamation property for a given class of finite structures is an important subroutine in classifying countable finitely homogeneous structures. We study the computational complexity of the amalgamation decision problem for…
In this note, we polynomially reduce an instance of the partition problem to a dynamic lot sizing problem, and show that solving the latter problem solves the former problem. By solving the dynamic program formulation of the dynamic lot…
This thesis settles a number of questions related to computational complexity and algebraic, semidefinite programming based relaxations in optimization and control.