✦ LIBER ✦

On The Parameterized Intractability Of Motif Search Problems*

✍ Scribed by Michael R. Fellows; Jens Gramm†; Rolf Niedermeier‡

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the inherent intractability of certai

✍ Berlekamp, E.; McEliece, R.; van Tilborg, H. 📂 Article 📅 1978 🏛 IEEE 🌐 English ⚖ 582 KB

The Parameterized Complexity of Counting

✍ Flum, Jörg; Grohe, Martin 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 347 KB

On intractability of the classUP

✍ Osamu Watanabe 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 568 KB

On the complexity of some colorful probl

✍ Michael R. Fellows; Fedor V. Fomin; Daniel Lokshtanov; Frances Rosamond; Saket S 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 357 KB

Parameterized Complexity and Local Searc

✍ Dániel Marx; Ildikó Schlotter 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 740 KB

On the parameterized complexity of the M

✍ Wenbin Chen; Matthew C. Schmidt; Nagiza F. Samatova 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 244 KB