The complexity of computing the Muirhead–Dalton distance

Research output: Contribution to journalArticleResearchpeer-review

Original languageEnglish
Pages (from-to)282-284
JournalMathematical social sciences
Volume57
Issue number2
DOIs
Publication statusPublished - 2009

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)
  • Theoretical

Cite this

The complexity of computing the Muirhead–Dalton distance. / Deineko, Vladimir; Klinz, Bettina; Wöginger, Gerhard Johannes.

In: Mathematical social sciences, Vol. 57, No. 2, 2009, p. 282-284.

Research output: Contribution to journalArticleResearchpeer-review

@article{7042198326934e8cab0514e318302a61,
title = "The complexity of computing the Muirhead–Dalton distance",
author = "Vladimir Deineko and Bettina Klinz and W{\"o}ginger, {Gerhard Johannes}",
year = "2009",
doi = "10.1016/j.mathsocsci.2008.11.005",
language = "English",
volume = "57",
pages = "282--284",
journal = "Mathematical social sciences",
issn = "0165-4896",
publisher = "Elsevier B.V.",
number = "2",

}

TY - JOUR

T1 - The complexity of computing the Muirhead–Dalton distance

AU - Deineko, Vladimir

AU - Klinz, Bettina

AU - Wöginger, Gerhard Johannes

PY - 2009

Y1 - 2009

U2 - 10.1016/j.mathsocsci.2008.11.005

DO - 10.1016/j.mathsocsci.2008.11.005

M3 - Article

VL - 57

SP - 282

EP - 284

JO - Mathematical social sciences

JF - Mathematical social sciences

SN - 0165-4896

IS - 2

ER -