Computing an Ulam median is NP-hard already for exactly four input permutations, which is the minimum possible since three permutations are easy.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Ulam Median is NP-hard for Four Permutations
Computing an Ulam median is NP-hard already for exactly four input permutations, which is the minimum possible since three permutations are easy.