✦ LIBER ✦

Mutilated chessboard problem is exponentially hard for resolution

✍ Scribed by Michael Alekhnovich

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The emptiness problem for indexed langua

✍ Shinichi Tanaka; Takumi Kasai 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 650 KB

The realization problem for Euclidean mi

✍ P. Eades and S. Whitesides 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 419 KB

Perfect matching for regular graphs is A

✍ Elias Dahlhaus; Marek Karpinski 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 491 KB

Why Newton’s method is hard for travelli

✍ John P. Boyd 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 434 KB

Reconstructing 3-Colored Grids from Hori

✍ Dürr, Christoph; Guiñez, Flavio; Matamala, Martin 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 609 KB