✦ LIBER ✦

Finding the smallest binarization of a CFG is NP-hard

✍ Scribed by Gómez-Rodríguez, Carlos

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding the probability of infection in

✍ Shapiro, Michael; Delgado-Eckert, Edgar 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 525 KB

Finding the maximum a posteriori probabi

✍ Fischbacher, Urs 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 509 KB

Computing the Stopping Distance of a Tan

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

The equational theory of a nontrivial di

✍ Stanley Burris 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 158 KB

A special case of the single-machine tot

✍ E. R. Gafarov; A. A. Lazarev 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 249 KB

Computing the Value of a Boolean Express

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