Related papers: Supercritical Space-Width Trade-offs for Resolutio…
The strong exponential-time hypothesis (SETH) is a commonly used conjecture in the field of complexity theory. It states that CNF formulas cannot be analyzed for satisfiability with a speedup over exhaustive search. This hypothesis and its…
We examine the recently proposed technique of adding boundary counterterms to the gravitational action for spacetimes which are locally asymptotic to anti-de Sitter. In particular, we explicitly identify higher order counterterms, which…
Proving super-polynomial lower bounds on the size of proofs of unsatisfiability of Boolean formulas using resolution over parities is an outstanding problem that has received a lot of attention after its introduction by Raz and Tzamaret…
In this note we show that any $k$-CNF which can be refuted by a quasi-polynomial $\mathsf{Res}^*(\mathsf{polylog})$ refutation has a "narrow" refutation in $\mathsf{Res}$ (i.e., of poly-logarithmic width). We also show the converse…
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…
Bonnet et al. (FOCS 2020) introduced the graph invariant twin-width and showed that many NP-hard problems are tractable for graphs of bounded twin-width, generalizing similar results for other width measures, including treewidth and…
The concept of space-bounded computability has become significantly important in handling vast data sets on memory-limited computing devices. To replenish the existing short list of NL-complete problems whose instance sizes are dictated by…
A new criterion for inextendibility of expanding cosmological models with symmetry is presented. It is applied to derive a number of new results and to simplify the proofs of existing ones. In particular it shows that the solutions of the…
We study the complexity of small-depth Frege proofs and give the first tradeoffs between the size of each line and the number of lines. Existing lower bounds apply to the overall proof size -- the sum of sizes of all lines -- and do not…
Data reconstruction attacks on trained neural networks aim to recover the data on which the network has been trained and pose a significant threat to privacy, especially if the training dataset contains sensitive information. Here, we…
For semiclassical problems we establish upper bounds on the number of resonances in boxes of size $h$ along the real axis, in terms of the dimension of the set of trapped trajectories. The proof uses second microlocalization.
In this survey we give an overview of recent developments on the Quantitative Subspace Theorem. In particular, we discuss a new upper bound for the number of subspaces containing the "large" solutions, obtained jointly with Roberto…
We obtain an upper bound on the minimal number of points in an $\epsilon$-chain joining two points in a metric space. This generalizes a bound due to Hambly and Kumagai (1999) for the case of resistance metric on certain self-similar…
We study the constraints of spacetime supersymmetry for perturbative three- and two-dimensional Minkowski vacua of the critical heterotic string. Assuming a standard RNS construction of the spacetime supersymmetry generators and a compact…
The Weak Cosmic Censorship (WCC) conjecture can be used as a consistency criterion for any viable modification over general relativity (GR). We employ this idea to show that in contrast to the black holes in GR, it is indeed possible to…
I consider configuration spaces for $N$-body problems, gauge theories and for GR in both geometrodynamical and Ashtekar variables forms, including minisuperspace and inhomogeneous perturbations thereabout in the former case. These examples…
Critical bandwidth (CB) is used to test the multimodality of densities and regression functions, as well as for clustering methods. CB tests are known to be inconsistent if the function of interest is constant ("flat") over even a small…
Recent findings reveal that over-parameterized deep neural networks, trained beyond zero training-error, exhibit a distinctive structural pattern at the final layer, termed as Neural-collapse (NC). These results indicate that the final…
In this paper, three outer bounds on the normalized storage-repair bandwidth (S-RB) tradeoff of regenerating codes having parameter set $\{(n,k,d),(\alpha,\beta)\}$ under the exact-repair (ER) setting are presented. The first outer bound is…
We review arguments that supersymmetric QCD with $N$ colors and $N_f \ge 0$ massive quarks confines. We explain that this remains the case for small soft breakings and small supersymmetric masses for any quarks. These results continue to…