Results 91 to 100 of about 58,584 (207)

The n-shot classical capacity of the quantum erasure channel

Journal of Physics Communications
We compute the n -shot classical capacity of the quantum erasure channel, providing upper bounds and almost-matching lower bounds for it, the latter achievable via large-minimum-distance classical linear codes for any n .
Matteo Rosati
doaj   +1 more source

Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. [PDF]

Algorithmica, 2016
Bansal N, Oosterwijk T, Vredeveld T, van der Zwaan R.   +3 more
europepmc   +1 more source

Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT [PDF]

, 2015
Bart M. P. Jansen, Astrid Pieterse
openalex   +1 more source

Investigation of Lower and Upper Bounds of a Jump Graph Using Topological Indices

, 2023
M. G. Veena, V. H. Narendra
openalex   +2 more sources

Upper and lower bounds for singularly perturbed linear quadratic optimal control problems

, 2017
Sei Howe
openalex   +2 more sources

Lower and upper bounds for the Bin Packing Problem with Fragile Objects

, 2012
François Clautiaux, Mauro Dell’Amico, Manuel Iori, Ali Khanafer   +3 more
openalex   +2 more sources

Exact lower and upper bounds for shifts of Gaussian measures [PDF]

, 2022
Iosif Pinelis
openalex   +1 more source

Sharp Upper and Lower Bounds of VDB Topological Indices of Digraphs [PDF]

, 2021
Juan Monsalve, Juan Rada
openalex   +1 more source

Upper and lower bounds in relator spaces.

, 2003
Summary: An ordered pair \(X({\mathcal N}) = (X,{\mathcal N})\) consisting of a nonvoid set \(X\) and a nonvoid family \({\mathcal N}\) of binary relations on \(X\) is called a relator space. Relator spaces are straightforward generalizations not only of uniform spaces, but also of ordered sets. Therefore, in a relator space we can naturally define not
openaire   +2 more sources

Upper and lower bounds on switching energy in VLSI [PDF]

, 1991
Gloria Kissin
openalex   +1 more source