Related papers: Sub-exponential Upper Bound for #XSAT of some CNF …

We bound EFT coefficients appearing in $2 \to 2$ photon scattering amplitudes in four dimensions. After reviewing unitarity and positivity conditions in this context, we use dispersion relations and crossing symmetry to compute sum rules…

Power law distributions are widely observed in chemical physics, geophysics, biology, and beyond. The independent variable x of these distributions has an obligatory lower bound and in many cases also an upper bound. Estimating these bounds…

We consider random systems of equations x_1 + ... + x_k = a; 0 <= a <= 2 which are interpreted as equations modulo 3: We show for k >= 15 that the satisfiability threshold of such systems occurs where the 2-core has density 1: We show a…

In this paper two algorithms solving circuit satisfiability problem over supernilpotent algebras are presented. The first one is deterministic and is faster than fastest previous algorithm presented by Aichinger. The second one is…

Lower bounds for some explicit decision problems over the complex numbers are given.

It is well known that there is a sharp density threshold for a random $r$-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal rule. Also, above the satisfiability threshold, where a…

We consider a variant of the Boolean satisfiability problem where a subset E of the propositional variables appearing in formula Fsat encode a symmetric, transitive, binary relation over N elements. Each of these relational variables,…

We focus on computing certified upper bounds for the positive maximal singular value (PMSV) of a given matrix. The PMSV problem boils down to maximizing a quadratic polynomial on the intersection of the unit sphere and the nonnegative…

This paper describes a novel unbounded software model checking approach to find errors in programs written in the C language based on incremental SAT-solving. Instead of using the traditional assumption based API to incremental SAT solvers…

We exhibit families of $4$-CNF formulas over $n$ variables that have sums-of-squares (SOS) proofs of unsatisfiability of degree (a.k.a. rank) $d$ but require SOS proofs of size $n^{\Omega(d)}$ for values of $d = d(n)$ from constant all the…

We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of…

Let $A$ be a random $m\times n$ matrix over the finite field $F_q$ with precisely $k$ non-zero entries per row and let $y\in F_q^m$ be a random vector chosen independently of $A$. We identify the threshold $m/n$ up to which the linear…

We generalize many results concerning the tractability of SAT and #SAT on bounded treewidth CNF-formula in the context of Quantified Boolean Formulas (QBF). To this end, we start by studying the notion of width for OBDD and observe that the…

Let $R(n)$ denote the number of rich words of length $n$ over a given finite alphabet. In 2017 it was proved that $\lim_{n\rightarrow\infty} \sqrt[n]{R(n)}=1$; it means the number of rich words has a subexponential growth. However, up to…

This paper considers a distributionally robust chance constraint model with a general ambiguity set. We show that a sample based approximation of this model converges under suitable sufficient conditions. We also show that upper and lower…

In this paper, we introduce a methodology, called decomposition-based reductions, for showing the equivalence among various problems of bounded-width. First, we show that the following are equivalent for any $\alpha > 0$: * SAT can be…

Random $k$-SAT is the single most intensely studied example of a random constraint satisfaction problem. But despite substantial progress over the past decade, the threshold for the existence of satisfying assignments is not known precisely…

We consider the problem of modulation and estimation of a random parameter $U$ to be conveyed across a discrete memoryless channel. Upper and lower bounds are derived for the best achievable exponential decay rate of a general moment of the…

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

We show that deciding simulation equivalence and simulation preorder have quadratic lower bounds assuming that the Strong Exponential Time Hypothesis holds. This is in line with the best know quadratic upper bounds of simulation…