✦ LIBER ✦

The eponym problem revisited

✍ Scribed by Claude H. Organ Jr.

Publisher: John Wiley and Sons
Year: 1991
Tongue: English
Weight: 54 KB
Volume: 4
Category: Article
ISSN: 0897-3806
DOI: 10.1002/ca.980040310

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Automorphism Tower Problem Revisited

✍ Winfried Just; Saharon Shelah; Simon Thomas 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 236 KB

It is well known that the automorphism towers of infinite centreless groups of cardinality } terminate in less than (2 } ) + steps. But an easy counting argument shows that (2 } ) + is not the best possible bound. However, in this paper, we will show that it is impossible to find an explicit better

The Optimal Alphabetic Tree Problem Revi

The Optimal Alphabetic Tree Problem Revisited

✍ Lawrence L Larmore; Teresa M Przytycka 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 202 KB

The Optimal Alphabetic Binary Tree OABT problem is equivalent to the Optimal Binary Search Tree problem where the weights are associated only with Ž . the leaves. The problem can be solved in O n log n time, while the best known Ž . lower bound is ⍀ n . In this paper we relate the complexity of the

The multiroute maximum flow problem revi

The multiroute maximum flow problem revisited

✍ Donglei Du; R. Chandrasekaran 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 283 KB

Eponyms

✍ Sir D'Arcy Power 📂 Article 📅 1922 🏛 John Wiley and Sons 🌐 English ⚖ 278 KB

Eponyms

✍ D'Arcy Power 📂 Article 📅 1922 🏛 John Wiley and Sons 🌐 English ⚖ 298 KB

A revisit to the student learning proble

A revisit to the student learning problem

✍ Y. H. Chen 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 438 KB