Pages that link to "Item:Q761246"
From MaRDI portal
The following pages link to NP-completeness of the Hamming salesman problem (Q761246):
Displayed 4 items.
- Information, possible worlds and the cooptation of scepticism (Q625697) (← links)
- Hardness and approximation of the asynchronous border minimization problem (Q1682885) (← links)
- Heuristic methods to consecutive block minimization (Q2664289) (← links)
- ON THE HARDNESS OF THE BORDER LENGTH MINIMIZATION PROBLEM ON A RECTANGULAR ARRAY (Q3069747) (← links)