✦ LIBER ✦

A generic approach to proving NP-hardness of partition type problems

✍ Scribed by Mikhail Y. Kovalyov; Erwin Pesch

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A bright side of NP-hardness of interval

✍ Bonnie Traylor; Vladik Kreinovich 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 855 KB

A note on proving the strong NP-hardness

✍ Radosław Rudek 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 116 KB

A note on proving the strong NP-hardness

✍ Radosław Rudek 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 116 KB

A Quasi-mechanical Method for Solving th

✍ W.Q. Huang; G.Q. Wang 📂 Article 📅 1994 🏛 Elsevier Science ⚖ 284 KB

A machine learning approach to algorithm

✍ Haipeng Guo; William H. Hsu 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 571 KB

A “Partitioned-Problem” Approach to Micr

✍ Anthony C. Fischer-Cripps 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 712 KB