Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
Saved in:
| Published in: | ArXiv cs.CC Recent Papers |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2026
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
- The Complexity of Stoquastic Sparse Hamiltonians
- On the Principal Minor Expansion and Complexity of the Symmetrized Determinant
- Exponential-Size Circuit Complexity is Comeager in Symmetric Exponential Time
- On the Complexity of Discounted Robust MDPs with $L_p$ Uncertainty Sets
- Rigid homotopies for sampling from algebraic varieties: a Waring structure complexity model
- The Exact Replica Threshold for Nonlinear Moments of Quantum States