✦ LIBER ✦

Some observations on the probabilistic algorithms and NP-hard problems

✍ Scribed by Ker-I Ko

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some Observations about the Randomness o

✍ Huynh, Dung T. 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 644 KB

On the NP-hardness of edge-deletion and

✍ Toshimasa Watanabe; Tadashi Ae; Akira Nakamura 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 1015 KB

Np-hardness proof and an approximation a

✍ Keizo Miyata; Shigeru Masuyama; Shin-ichi Nakayama; Liang Zhao 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 309 KB

A machine learning approach to algorithm

✍ Haipeng Guo; William H. Hsu 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 571 KB

Some observations on the probabilistic i

✍ G. Grandori; E. Guagenti; F. Perotti 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 678 KB

On NP-hardness of the clique partition—I

✍ Stanislav Busygin; Dmitrii V. Pasechnik 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 162 KB