✦ LIBER ✦

Computation of lucky number of planar graphs is NP-hard

✍ Scribed by A. Ahadi; A. Dehghan; M. Kazemi; E. Mollaahmadi

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the Stopping Distance of a Tan

✍ Krishnan, K.M.; Shankar, P. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 139 KB

Computing roots of graphs is hard

✍ Rajeev Motwani; Madhu Sudan 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 570 KB

Problem of optimizing the number of bloc

✍ Farshad Fotouhi; Sakti Pramanik 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 665 KB

Computing the Value of a Boolean Express

✍ Leticia S. Chee 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 652 KB

Computing Exact Bounds on Elements of an

✍ Gregory E. Coxson 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 142 KB

Note Computing the nucleolus of min-cost

✍ Ulrich Faigle; Walter Kern; Jeroen Kuipers 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 153 KB