✦ LIBER ✦

An Upper Bound for the Cardinality of ans-Distance Set in Euclidean Space

✍ Scribed by Etsuko Bannai; Kazuki Kawasaki; Yusuke Nitamizu; Teppei Sato

Publisher: Springer-Verlag
Year: 2003
Tongue: English
Weight: 259 KB
Volume: 23
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-003-0032-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Upper-Bound theorem for families of c

An Upper-Bound theorem for families of convex sets

✍ Jürgen Eckhoff 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 470 KB

An upper bound for the minimum diameter

An upper bound for the minimum diameter of integral point sets

✍ Heiko Harborth; Arnfried Kemnitz; Meinhard Möller 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 243 KB

An upper bound on the number of planarK-

An upper bound on the number of planarK-sets

✍ János Pach; William Steiger; Endre Szemerédi 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 746 KB

Minimal distance upper bounds for the pe

Minimal distance upper bounds for the perturbation of least squares problems in Hilbert spaces

✍ J. Ding 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 275 KB

In this paper, we present an optimal perturbation result on the least squares solutions to the operator equation Tx = y under the most general condition. (~) 2002 Elsevier Science Ltd. All rights reserved.

The degree of approximation of sets in e

The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension

✍ Vitaly Maiorov; Joel Ratsaby 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 872 KB

The degree of approximation of infinite-dimensional function classes using finite n-dimensional manifolds has been the subject of a classical field of study in the area of mathematical approximation theory. In Ratsaby and Maiorov (1997), a new quantity p,(F, L,) which measures the degree of approxim

The unicity distance: An upper bound on

The unicity distance: An upper bound on the probability of an eavesdropper successfully estimating the secret key

✍ A.Kh.Al Jabri 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 420 KB

The unicity distance, U, of a secret-key cipher is defined by Shannon as the minimum amount of intercepted ciphertext symbols needed, in principle, to uniquely determine the secret key and, therefore, break the cipher. Accordingly, for a ciphertext of size N symbols less than U, the estimated key wi