✦ LIBER ✦

A short proof of an algorithm by Boehm

✍ Scribed by Georg Kirrmann

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 146 KB
Volume: 9
Category: Article
ISSN: 0167-8396
DOI: 10.1016/0167-8396(92)90053-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A short proof of the Oslo algorithm

✍ Hartmut Prautzsch 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 73 KB

A short proof of the lexical addressing

A short proof of the lexical addressing algorithm

✍ Mitchell Wand 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 391 KB

An assertional proof of Rana's algorithm

✍ Michiel C. van Wezel; Gerard Tel 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 645 KB

An algorithmic proof of the polyhedral d

An algorithmic proof of the polyhedral decomposition theorem

✍ Mustafa Akgül 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 504 KB

A Short Proof of Weyl's Lemma

✍ Roland Lemmert 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 71 KB

Let Q c R a be open and LZ~=ZcaD026 be n linear differential opentor with constant coefficients, and adjoint L\*zi = C (l)'"'e,Dazs. We give D proof of the following variant of WEYL'S lemma. d Letit~rta. Every contiwma 8olutim of h = O in the distributional sense is the iocalhj uniform h i t of G+'-

A short proof of fisher's inequality

✍ Renaud Palisse 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 71 KB

Nous donnons ici une dtmonstration nouvelle, trts courte, de I'iGgaliti de Fisher, qui gCntralise un rCsultat bien connu de de Bruijn et ErdGs. Cette dtmonstration utilise essentiellement une id&e de Tverberg (1982) pour dt-montrer un autre tnonct combinatoire. We prove the following result.