Related papers: Lower Bounds from Succinct Hitting Sets
Coherent lower previsions are general probabilistic models allowing incompletely specified probability distributions. However, for complete description of a coherent lower prevision -- even on finite underlying sample spaces -- an infinite…
Leveraging algorithmic stability to derive sharp generalization bounds is a classic and powerful approach in learning theory. Since Vapnik and Chervonenkis [1974] first formalized the idea for analyzing SVMs, it has been utilized to study…
We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…
We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…
We prove three theorems giving extremal bounds on the incidence structures determined by subsets of the points and blocks of a balanced incomplete block design (BIBD). These results generalize and strengthen known bounds on the number of…
We show that lower bounds on the border rank of matrix multiplication can be used to non-trivially derandomize polynomial identity testing for small algebraic circuits. Letting $\underline{R}(n)$ denote the border rank of $n \times n \times…
We prove new upper bounds on homotopy and homology groups of o-minimal sets in terms of their approximations by compact o-minimal sets. In particular, we improve the known upper bounds on Betti numbers of semialgebraic sets defined by…
We study the minimum number of constraints needed to formulate random instances of the maximum stable set problem via linear programs (LPs), in two distinct models. In the uniform model, the constraints of the LP are not allowed to depend…
The geometric hitting set problem is one of the basic geometric combinatorial optimization problems: given a set $P$ of points, and a set $\mathcal{D}$ of geometric objects in the plane, the goal is to compute a small-sized subset of $P$…
Recent work proposed $\delta$-relevant inputs (or sets) as a probabilistic explanation for the predictions made by a classifier on a given input. $\delta$-relevant sets are significant because they serve to relate (model-agnostic) Anchors…
We show that if $f : \mathbb{A}_{\bar{\mathbb{Q}}}^r \to \mathbb{A}_{\bar{\mathbb{Q}}}^r$ is a regular self-map and $P \in \mathbb{A}^r(\bar{\mathbb{Q}})$ has $\limsup_{n \in \mathbb{N}} \frac{\log{h_{\mathrm{aff}}(f^nP)}}{\log{n}} < 1/r$,…
We prove the first inverse theorem for point--sphere incidence bounds over finite fields in dimensions $d \ge 3$, showing that near-extremality forces algebraic rigidity. While sharp upper bounds have been known for over a decade, the…
Given positive integers $k\leq d$ and a finite field $\mathbb{F}$, a set $S\subset\mathbb{F}^{d}$ is $(k,c)$-subspace evasive if every $k$-dimensional affine subspace contains at most $c$ elements of $S$. By a simple averaging argument, the…
For an n-vertex directed graph $G = (V,E)$, a $\beta$-\emph{shortcut set} $H$ is a set of additional edges $H \subseteq V \times V$ such that $G \cup H$ has the same transitive closure as $G$, and for every pair $u,v \in V$, there is a…
We analyse how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional, algebraic, and semi-algebraic proof systems, the classical constructions of…
We initiate the study of the algorithmic problem of certifying lower bounds on the discrepancy of random matrices: given an input matrix $A \in \mathbb{R}^{m \times n}$, output a value that is a lower bound on $\mathsf{disc}(A) = \min_{x…
A longstanding problem related to floating-point implementation of numerical programs is to provide efficient yet precise analysis of output errors. We present a framework to compute lower bounds on largest absolute roundoff errors, for a…
Recently, the separated fragment (SF) has been introduced and proved to be decidable. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. The known upper bound on the time…
Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…
Answer Set Programming (ASP) is a generic problem modeling and solving framework with a strong focus on knowledge representation and a rapid growth of industrial applications. So far, the study of complexity resulted in characterizing…