✦ LIBER ✦

NP-completeness of the hamming salesman problem

✍ Scribed by Jarmo Ernvall; Jyrki Katajainen; Martti Penttonen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

NP-Completeness of the linear complement

✍ S. J. Chung 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 283 KB

The NP-Completeness of the bandwidth min

✍ Ch. H. Papadimitriou 📂 Article 📅 1976 🏛 Springer Vienna 🌐 English ⚖ 375 KB

A polynomial-time linear decision tree f

✍ Martin Kolinek 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 630 KB

Strong NP-completeness of a matrix simil

✍ V. Brimkov; B. Codenotti; M. Leoncini; G. Resta 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 469 KB

The adjacency relation on the traveling

✍ Christos H. Papadimitriou 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 621 KB

NP-completeness of some type of p-center

✍ Tohru Kikuno; Noriyoshi Yoshida; Yoshiaki Kakuda 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 360 KB