相关论文: Lower bounds for some decision problems over C

We draw two incomplete, biased maps of challenges in computational complexity lower bounds.

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

New lower bounds involving sum, difference, product, and ratio sets for $A\subset \C$ are given.

We obtain upper bounds on the number of finite sets $\mathcal S$ of primes below a given bound for which various $2$ variable $\mathcal S$-unit equations have a solution.

We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.

This paper addresses the problem of deciding the lower-boundedness of an arbitrary real polynomial p in n variables.

We give lower bounds on the case of worst inhomogeneous approximation.

We provide a lower bound on the probability that a binomial random variable is exceeding its mean. Our proof employs estimates on the mean absolute deviation and the tail conditional expectation of binomial random variables.

In the paper, some lower bounds for polygamma functions are refined.

Let $\mathcal{A}$ be an abelian category. Denote by $\mathrm{D}^{b}(\mathcal{A})$ the bounded derived category of $\mathcal{A}$. In this paper, we investigate the lower bounds for the levels of objects in $\mathrm{D}^{b}(\mathcal{A})$ with…

We give an exponential lower bound for Berge-Ramsey problems.

This note is devoted to show a simple proof of a tight lower bound of the parameterized compact set packing problem, based on ETH.

Easily computable lower and upper bounds are found for the sum of Catalan numbers. The lower bound is proven to be tighter than the upper bound, which previously was declared to be only an asymptotic. The average of these bounds is proven…

The exact lower bound on the probability of the occurrence of exactly one of $n$ random events each of probability $p$ is obtained.

This is a survey on the use of low-degree polynomials to predict and explain the apparent statistical-computational tradeoffs in a variety of average-case computational problems. In a nutshell, this framework measures the complexity of a…

We give the proof of a tight lower bound on the probability that a binomial random variable exceeds its expected value. The inequality plays an important role in a variety of contexts, including the analysis of relative deviation bounds in…

We derive a simple lower bound for the multi-version coding problem formulated in [1]. We also propose simple algorithms that almost match the lower bound derived. Another lower bound is proven for an extended version of the multi-version…

In this paper we prowide lower bounds on the complexity of the DNF exception problem for short exception lists and hypercube covering problem. The method proposed is based on the relaxation of the initial problem to a certain linear…

We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…