✦ LIBER ✦

The complexity of computing the Muirhead–Dalton distance

✍ Scribed by Vladimir G. Deineko; Bettina Klinz; Gerhard J. Woeginger

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 259 KB
Volume: 57
Category: Article
ISSN: 0165-4896
DOI: 10.1016/j.mathsocsci.2008.11.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of computing minimum sepa

The complexity of computing minimum separating polygons

✍ Peter Eades; David Rappaport 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 277 KB

On computing the minimum distance of lin

On computing the minimum distance of linear codes

✍ Masami Mohri; Masakatu Morii 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 2 views

The weight distribution is an indispensable parameter in the performance evaluation of a code because of its importance in the analysis of the codes characteristics. Since the amount of computation needed to determine the overall weight distribution of a code usually depends on the number of data po

Computing the average distance of an int

Computing the average distance of an interval graph

✍ Peter Dankelmann 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 306 KB

What is the complexity of a distributed

What is the complexity of a distributed computing system?

✍ Anand Ranganathan; Roy H. Campbell 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB

The complexity of computing symmetric fu

The complexity of computing symmetric functions using threshold circuits

✍ Paul Beame; Erik Brisson; Richard Ladner 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 811 KB

An algorithm for computing the distance

An algorithm for computing the distance to uncontrollability

✍ L. Elsner; C. He 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 555 KB