The complexity of computing the Muirhead-Dalton distance (Q1013525)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5544881
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of computing the Muirhead-Dalton distance |
scientific article; zbMATH DE number 5544881 |
Statements
The complexity of computing the Muirhead-Dalton distance (English)
0 references
20 April 2009
0 references
income inequality
0 references
Muirhead-Dalton transfer
0 references
Lorenz-domination
0 references
majorization
0 references
computational complexity
0 references
0.6918181777000427
0 references
0.6801570057868958
0 references
0.6761420369148254
0 references
0.6759493947029114
0 references
