✦ LIBER ✦

Solution of Ulam's problem on binary search with three lies

✍ Scribed by Alberto Negro; Matteo Sereno

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 263 KB
Volume: 59
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(92)90107-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solution of Ulam's problem on binary sea

Solution of Ulam's problem on binary search with two lies

✍ Jurek Czyzowicz; Andrzej Pelc; Daniele Mundici 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 266 KB

Ulam's searching game with three lies

✍ Alberto Negro; Matteo Sereno 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 988 KB

Solution of Ulam's problem on searching

Solution of Ulam's problem on searching with a lie

✍ Andrzej Pelc 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 604 KB

Ulam's searching game with a fixed numbe

Ulam's searching game with a fixed number of lies

✍ Joel Spencer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 880 KB

Network flow problems with one side cons

Network flow problems with one side constraint: A comparison of three solution methods

✍ K. Belling-Seib; P. Mevert; Chr. Müller 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 994 KB

Existence of three positive solutions fo

Existence of three positive solutions for -point boundary-value problems with one-dimensional -Laplacian

✍ Hanying Feng; Weigao Ge 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 214 KB

In this paper, we consider the multipoint boundary value problem for the one-dimensional p-Laplacian (φ p (u )) + q(t) f (t, u(t), u (t)) = 0, t ∈ (0, 1), subject to the boundary conditions: where φ p (s) = |s| p-2 s, p > 1, ξ i ∈ (0, 1) with 0 < ξ 1 < ξ 2 < • • • < ξ m-2 < 1 and a i ∈ [0, 1), 0 ≤