Pages that link to "Item:Q631772"
From MaRDI portal
The following pages link to The transposition median problem is NP-complete (Q631772):
Displaying 5 items.
- Reversal and transposition medians (Q1022594) (← links)
- Topology of strings: median string is NP-complete (Q1978500) (← links)
- On the computational complexity of closest genome problems (Q2295622) (← links)
- MPF problem over modified medial semigroup is NP-complete (Q2333870) (← links)
- Partition–Mallows Model and Its Inference for Rank Aggregation (Q6107212) (← links)