✦ LIBER ✦

Pool resolution is NP-hard to recognize

✍ Scribed by Samuel R. Buss

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Finding approximate solutions to NP-hard

✍ Xin Yao 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 476 KB

Approximating CVP to Within Almost-Polyn

✍ I. Dinur; G. Kindler; R. Raz; S. Safra 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 512 KB

Minimum Propositional Proof Length Is NP

✍ Michael Alekhnovich, Sam Buss, Shlomo Moran and Toniann Pitassi 📂 Article 📅 2001 🏛 Association for Symbolic Logic 🌐 English ⚖ 459 KB

Finding Well-Conditioned Similarities to

✍ M. Gu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 487 KB