Results 41 to 50 of about 5,109,809 (289)
Quantum SDP-Solvers: Better upper and lower bounds [PDF]
Quantum, 2020 Brandão and Svore \cite{brandao2016QSDPSpeedup} recently gave quantum algorithms for approximately solving semidefinite programs, which in some regimes are faster than the best-possible classical algorithms in terms of the dimension $n$ of the problem ...
Joran van Apeldoorn +3 more
doaj +1 more source
, 2015 Distance upper-bounding DUB allows a verifier to know whether a proving party is located within a certain distance bound. DUB protocols have many applications in secure authentication and location based services. We consider the dual problem of distance lower bounding DLB, where the prover proves it is outside a distance bound to the verifier.
Xifan Zheng +2 more
openaire +3 more sources
Lower and upper bounds of ς(3) [PDF]
, 2001 In this short note, using refinements of Jordan’s inequality and an integral expression of ς(3), the lower and upper bounds of ς(3) are obtained, and some related results are ...
Qi, Feng, Wei, Zong-Li, Luo, Qiu-Ming
core +6 more sources
Model Checking Lower Bounds for Simple Graphs [PDF]
Logical Methods in Computer Science, 2014 A well-known result by Frick and Grohe shows that deciding FO logic on trees involves a parameter dependence that is a tower of exponentials. Though this lower bound is tight for Courcelle's theorem, it has been evaded by a series of recent meta-theorems
Michael Lampis
doaj +1 more source
Discrete Optimization, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Neeldhara Misra +2 more
openaire +3 more sources
Lower Bounds for Approximate LDCs [PDF]
, 2014 We study an approximate version of $q$-query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A $q$-query $(α,δ)$-approximate LDC is a set $V$ of $n$ points in $\mathbb{R}^d$ so that, for each $i \in [d]$ there are $Ω(δn)$ disjoint $q$-tuples $(\vec{u}_1,\ldots,\vec{u}_q) $ in $V$ so that
J. Briët (Jop) +3 more
openaire +5 more sources
Uniform bounds on the 1-norm of the inverse of lower triangular Toeplitz matrices [PDF]
, 2011 A uniform bound on the 1-norm is given for the inverse of a lower triangular Toeplitz matrix with non-negative monotonically decreasing entries whose limit is zero. The new bound is sharp under certain specified constraints.
Yuan, Y.X. +3 more
core +4 more sources
Lower Bound of the Complexity of Seven-Valued Functions in the Class of Polarized Polynomials
Известия Иркутского государственного университета: Серия "Математика", 2017 One of the directions of the investigation of functions over finite fields is the study of their representations, including polynomial ones. In the area of polynomial representations of functions the problem of estimating the complexity of such ...
A.S. Baliuk, A.S. Zinchenko
doaj +1 more source
Treewidth Lower Bounds with Brambles [PDF]
Algorithmica, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans L. Bodlaender +2 more
openaire +7 more sources
A Lower Bound for Scheduling Mechanisms [PDF]
Algorithmica, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
George Christodoulou 0001 +2 more
openaire +8 more sources