Affordable Access

The complexity of computing the Muirhead-Dalton distance

Authors
Publisher
Elsevier BV
Publication Date
Keywords
  • Qa Mathematics
  • H Social Sciences
Disciplines
  • Computer Science

Abstract

We show that the following problem is NP-hard, and hence computationally intractable: "Given a vectory that Lorenz-dominates a vector x, what is the smallest number of Muirhead-Dalton transfers that transform x into y?" (C) 2008 Elsevier B.V. All rights reserved.

There are no comments yet on this publication. Be the first to share your thoughts.