✦ LIBER ✦

Tight lower bounds for certain parameterized NP-hard problems

✍ Scribed by Jianer Chen; Benny Chor; Mike Fellows; Xiuzhen Huang; David Juedes; Iyad A. Kanj; Ge Xia

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tight lower bound for the train revers

✍ Alok Aggarwal; Tom Leighton 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 319 KB

A tight lower bound for the completion t

✍ C.T. Ng; X. Cai; T.C.E. Cheng 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 216 KB

Labeled Search Trees and Amortized Analy

✍ Jianer Chen; Iyad A. Kanj; Ge Xia 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 270 KB

Exponential lower bounds for some NP-com

✍ Esko Ukkonen 📂 Article 📅 1983 🏛 Springer Netherlands 🌐 English ⚖ 751 KB

The most congested cutset: deriving a ti

✍ Sharafat, A.R.; Ma'rouzi, O.R. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 101 KB