✦ LIBER ✦

On the hardness of approximating the permanent of structured matrices

✍ Scribed by Bruno Codenotti; John D. Shparlinski; Arne Winterhof

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Hardness of Approximating the Chr

✍ Khanna, Sanjeev (author);Linial, Nathan (author);Safra, Shmuel (author) 📂 Article 📅 2000 🏛 Janos Bolyai Mathematical Society 🌐 English ⚖ 311 KB

On the Hardness of Approximating the Chr

✍ Khanna, Sanjeev (author);Linial, Nathan (author);Safra, Shmuel (author) 📂 Article 📅 2000 🏛 Janos Bolyai Mathematical Society 🌐 English ⚖ 311 KB

On the Hardness of Approximating the Min

✍ Ramkumar Chinchani; Duc Ha; Anusha Iyer; Hung Q. Ngo; Shambhu Upadhyaya 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 749 KB

The Hardness of Approximating Spanner Pr

✍ Michael Elkin; David Peleg 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 366 KB

ON THE HARDNESS OF APPROXIMATING MULTICU

✍ Shuchi Chawla; Robert Krauthgamer; Ravi Kumar; Yuval Rabani; D. Sivakumar 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 241 KB

On the hardness of efficiently approxima

✍ Andreas Brieden; Shawn Cokus 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 206 KB