Results 31 to 40 of about 96,047 (264)
, 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 +2 more sources
A compact model for the home healthcare routing and scheduling problem
EURO Journal on Computational OptimizationHome healthcare has become more and more central in the last decades, due to the advantages it can bring to both healthcare institutions and patients. Planning activities in this context, however, presents significant challenges related to route planning
Roberto Montemanni +2 more
doaj +1 more source
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
Discrete Optimization, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Neeldhara Misra +2 more
openaire +2 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 +4 more sources
A lower bound on opaque sets [PDF]
Computational Geometry, 2019 13 pages, 10 ...
Akitoshi Kawamura +3 more
openaire +5 more sources
Lower bounds on expressions dependent on functions φ(n), ψ(n) and σ(n), II [PDF]
Notes on Number Theory and Discrete MathematicsIn this paper we establish lower bounds on several expressions dependent on functions φ(n), ψ(n) and σ(n).
Stoyan Dimitrov
doaj +1 more source
Setting lower bounds on truthfulness [PDF]
Games and Economic Behavior, 2018 We present and discuss general techniques for proving inapproximability results for truthful mechanisms. We make use of these techniques to prove lower bounds on the approximability of several non-utilitarian multi-parameter problems. In particular, we demonstrate the strength of our techniques by exhibiting a lower bound of $2-\frac{1}{m}$ for the ...
Ahuva Mu'alem, Michael Schapira
openaire +2 more sources
Scientific Journal of Informatics, 2018 The completion of gravitational data inversion results in a smooth recovered model. GRAV3D is one software that can be used to solve 3D inversion problems of gravity data.
Mochamad Aryono Adhi +3 more
doaj +1 more source
Energy of Nonsingular Graphs: Improving Lower Bounds
Journal of Mathematics, 2021 Let G be a simple graph of order n and A be its adjacency matrix. Let λ1≥λ2≥…≥λn be eigenvalues of matrix A. Then, the energy of a graph G is defined as εG=∑i=1nλi.
Hajar Shooshtari +3 more
doaj +1 more source