✦ LIBER ✦

Computing roots of graphs is hard

✍ Scribed by Rajeev Motwani; Madhu Sudan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computation of lucky number of planar gr

✍ A. Ahadi; A. Dehghan; M. Kazemi; E. Mollaahmadi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 198 KB

Computing square roots of trivially perf

✍ Milanič, Martin; Schaudt, Oliver 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 393 KB

Computing the Stopping Distance of a Tan

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

Recognizing tough graphs is NP-hard

✍ D. Bauer; S.L. Hakimi; E. Schmeichel 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 326 KB

String graphs. II. recognizing string gr

✍ Jan Kratochvíl 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 712 KB

How hard is it to match CVC-roots?

✍ Don Ringe 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB