Related papers: Exponential-Size Circuit Complexity is Comeager in…
We give new evidence that quantum circuits are substantially more powerful than classical circuits. We show, relative to a random oracle, that polynomial-size quantum circuits can sample distributions that subexponential-size classical…
We give some natural sufficient conditions for balls in a metric space to have small intersection. Roughly speaking, this happens when the metric space is (i) expanding and (ii) well-spread, and (iii) a certain random variable on the…
Random constraint satisfaction problems (CSPs) such as random $3$-SAT are conjectured to be computationally intractable. The average case hardness of random $3$-SAT and other CSPs has broad and far-reaching implications on problems in…
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. This framework includes well known graph problems such as Minimum…
We study the Maximum Budgeted Allocation problem, i.e., the problem of selling a set of $m$ indivisible goods to $n$ players, each with a separate budget, such that we maximize the collected revenue. Since the natural assignment LP is known…
We introduce a general random model of a combinatorial optimization problem with geometric structure that encapsulates both linear programming and integer linear programming. Let $Q$ be a bounded set called the feasible set, $E$ be an…
We illustrate how computer-aided methods can be used to investigate the fundamental limits of the caching systems, which are significantly different from the conventional analytical approach usually seen in the information theory…
We show that the loop $O(n)$ model on the hexagonal lattice exhibits exponential decay of loop sizes whenever $n> 1$ and $x<\tfrac{1}{\sqrt{3}}+\varepsilon(n)$, for some suitable choice of $\varepsilon(n)>0$. It is expected that, for $n…
We report the first improvement in the space-time trade-off of lower bounds for the orthogonal range searching problem in the semigroup model, since Chazelle's result from 1990. This is one of the very fundamental problems in range…
Dirac's approach to the canonical quantization of constrained systems is applied to $N = 1$ supergravity, with or without gauged supermatter. Two alternative types of boundary condition applicable to quantum field theory or quantum gravity…
Mixed-integer (MI) quadratic models subject to quadratic constraints, known as All-Quadratic MI Programs, constitute a challenging class of NP-complete optimization problems. The particular scenario of unbounded integers defines a subclass…
In 1979 Valiant showed that the complexity class VP_e of families with polynomially bounded formula size is contained in the class VP_s of families that have algebraic branching programs (ABPs) of polynomially bounded size. Motivated by the…
Multiplication is one of the most fundamental computational problems, yet its true complexity remains elusive. The best known upper bound, by F\"{u}rer, shows that two $n$-bit numbers can be multiplied via a boolean circuit of size $O(n \lg…
We develop a polynomial method on finite fields to amplify the hardness of spare sets in nondeterministic time complexity classes on a randomized streaming model. One of our results shows that if there exists a $2^{n^{o(1)}}$-sparse set in…
This article contains two rigidity type results for $\mathrm{SL}(n,\mathbb{Z})$ for large $n$ that share the same proof. Firstly, we prove that for every $p \in [1,\infty]$ different from $2$, the noncommutative $L^p$-space associated with…
We study best-policy identification for finite-horizon risk-sensitive reinforcement learning under the entropic risk measure. Recent work established a constant gap in the exponential horizon dependence between lower and upper bounds on the…
This article shows that PSPACE not equal EXP. A simple but novel proof technique has been used to separate these two classes. Whether an arbitrary Turing machine accepts an input when the running time is limited has been computed in this…
A classical upper bound for quantum entropy is identified and illustrated, $0\leq S_q \leq \ln (e \sigma^2 / 2\hbar)$, involving the variance $\sigma^2$ in phase space of the classical limit distribution of a given system. A fortiori, this…
Given a $k$-CNF formula and an integer $s$, we study algorithms that obtain $s$ solutions to the formula that are maximally dispersed. For $s=2$, the problem of computing the diameter of a $k$-CNF formula was initiated by Creszenzi and…
Computing tight Lipschitz bounds for deep neural networks is crucial for analyzing their robustness and stability, but existing approaches either produce relatively conservative estimates or rely on semidefinite programming (SDP)…