Related papers: Lower bounds for some decision problems over C
We provide a formula for the lower bound in the form of $|F| \ge K$, in such a way that the decision version of unweighted non-bipartite matching can be solved in polynomial time. ~The parameter $K$ can vary from instance to instance. We…
In this paper we establish lower bounds on information divergence of a distribution on the integers from a Poisson distribution. These lower bounds are tight and in the cases where a rate of convergence in the Law of Thin Numbers can be…
We propose a new approach to solving dynamic decision problems with rewards that are unbounded below. The approach involves transforming the Bellman equation in order to convert an unbounded problem into a bounded one. The major advantage…
We give an upper bound that relates the minimum weight of a nonzero componentwise product of codewords from some given number of linear codes, with the dimensions of these codes. Its shape is a direct generalization of the classical…
We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].
In this note we would like to give an explicit lower bound by using a lower saturated subset of \mathbb{R}_{\geq 0}^n.
We derive new upper and lower bounds for probabilities that $r$ or at least $r$ from $n$ events occur. These bounds can turn to equalities. The method is discussed as well. It works for measurable space and measures with sign, too. We also…
We prove a tight quantum query lower bound $\Omega(n^{k/(k+1)})$ for the problem of deciding whether there exist $k$ numbers among $n$ that sum up to a prescribed number, provided that the alphabet size is sufficiently large. This is an…
New criteria are established for upper bounds on the number of limit cycles of periodic Abel differential equations having two periodic invariant curves, one of them bounded. The criteria are applied to obtain upper bounds of either zero or…
We introduce linear programs encoding regular expressions of finite languages. We show that, given a language, the optimum value of the associated linear program is a lower bound on the size of any regular expression of the language.…
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…
In this tutorial, we will survey known results on the complexity of conjunctive query evaluation in different settings, ranging from Boolean queries over counting to more complex models like enumeration and direct access. A particular focus…
An apriori bound for the condition number associated to each of the following problems is given: general linear equation solving, minimum squares, non-symmetric eigenvalue problems, solving univariate polynomials, solving systems of…
We consider the problem of computing upper and lower bounds on the price of a European basket call option, given prices on other similar baskets. Although this problem is very hard to solve exactly in the general case, we show that in some…
We give upper and lower bounds for the number of solutions of the equation $p(z)\log|z|+q(z)=0$ with polynomials $p$ and $q$.
We derive an upper bound on the number of models for exact satisfiability (XSAT) of arbitrary CNF formulas F. The bound can be calculated solely from the distribution of positive and negated literals in the formula. For certain subsets of…
We consider a class of optimization problems defined by a system of linear equations with min and max operators. This class of optimization problems has been studied under restrictive conditions, such as, (C1) the halting or stability…
In this paper, we study estimates for eigenvalues of the clamped plate problem. A sharp upper bound for eigenvalues is given and the lower bound for eigenvalues in [10] is improved.
Computational complexity is a core theory of computer science, which dictates the degree of difficulty of computation. There are many problems with high complexity that we have to deal, which is especially true for AI. This raises a big…
Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…