Related papers: On algebraic branching programs of small width
There has been a lot of interest recently in proving lower bounds on the size of linear programs needed to represent a given polytope P. In a breakthrough paper Fiorini et al. [Proceedings of 44th ACM Symposium on Theory of Computing 2012,…
We prove that the number of distinct homotopy types of limits of one-parameter semi-algebraic families of closed and bounded semi-algebraic sets is bounded singly exponentially in the additive complexity of any quantifier-free first order…
To study any dynamical system it is useful to find a partition that allows essentially faithful encoding (injective, up to a small exceptional set) into a subshift. Most topological and measure-theoretic systems can be represented by…
Let $\mathrm{R}$ be a real closed field. We prove that for any fixed $d$, the equivariant rational cohomology groups of closed symmetric semi-algebraic subsets of $\mathrm{R}^k$ defined by polynomials of degrees bounded by $d$ vanishes in…
We observe that a certain kind of algebraic proof - which covers essentially all known algebraic circuit lower bounds to date - cannot be used to prove lower bounds against VP if and only if what we call succinct hitting sets exist for VP.…
Assuming the Generalised Riemann Hypothesis (GRH), we show that for all k, there exist polynomials with coefficients in $\MA$ having no arithmetic circuits of size O(n^k) over the complex field (allowing any complex constant). We also build…
In this paper we study the {\it bilinear assignment problem} (BAP) with size parameters $m$ and $n$, $m\leq n$. BAP is a generalization of the well known quadratic assignment problem and the three dimensional assignment problem and hence…
Inspired by code vertex operator algebras (VOAs) and their representation theory, we define code algebras, a new class of commutative non-associative algebras constructed from binary linear codes. Let $C$ be a binary linear code of length…
We systematically analyze a class of hexanomial functions over finite fields of characteristic $2$ proposed by Dillon (2006) as candidates for almost perfect nonlinear (APN) functions, significantly extending earlier partial-APN results.…
We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…
We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such graphs have small separators. Next, we present efficient…
We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set,…
We prove two sets of results concerning computational complexity classes. The first concerns a variation of the random oracle hypothesis posed by Bennett and Gill after they showed that relative to a randomly chosen oracle, P not equal NP…
A strong $\ell$-ification of a matrix polynomial $P(\lambda)=\sum A_i\lambda^i$ of degree $d$ is a matrix polynomial $\mathcal{L}(\lambda)$ of degree $\ell$ having the same finite and infinite elementary divisors, and the same numbers of…
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…
We study the power of the bounded-width consistency algorithm in the context of the fixed-template Promise Constraint Satisfaction Problem (PCSP). Our main technical finding is that the template of every PCSP that is solvable in bounded…
This paper introduces and studies a class of Weyl-type algebras \(A_{p,t,\cA} = \Weyl{e^{\pm x^{p} e^{t x}},\; e^{\cA x},\; x^{\cA}}\) constructed over exponential-polynomial rings, where \(\FF\) is a field of characteristic zero, \(\cA\)…
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…
The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness,…
In this paper we show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs. In particular, our approach…