✦ LIBER ✦

A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions

✍ Scribed by Štefankovič, Daniel; Vempala, Santosh; Vigoda, Eric

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Polynomial Time Approximation Scheme f

✍ Chekuri, Chandra; Khanna, Sanjeev 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 200 KB

A New Fully Polynomial Time Approximatio

✍ Hans Kellerer; Ulrich Pferschy 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 76 KB

A polynomial time approximation scheme f

✍ Jianping Li, Weidong Li, Lusheng Wang 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 433 KB

A Polynomial Time Approximation Scheme f

✍ Chen, Jianer; Miranda, Antonio 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 215 KB

A Polynomial Time Approximation Scheme f

✍ Xiuzhen Cheng; Joon-Mo Kim; Bing Lu 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 127 KB

A polynomial time approximation scheme f

✍ Sanjeev Khanna 📂 Article 📅 2002 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 110 KB 👁 1 views