✦ LIBER ✦

Quasi-polynomial tractability of linear problems in the average case setting

✍ Scribed by Xu, Guiqiao

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial-Time Algorithms for Multivari

✍ G. W. Wasilkowski; H. Woźniakowski 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 644 KB

Complexity of multilinear problems in th

✍ Tomasz Jackowski 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 960 KB

The linking set problem: a polynomial sp

✍ A. Agra; C. Requejo 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 177 KB

Tractability of infinite-dimensional int

✍ L. Plaskota; G.W. Wasilkowski 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 290 KB

The setting of weights in linear goal-pr

✍ Saul I. Gass 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 379 KB

Complexity of multilinear problems in th

✍ Tomasz Jackowski 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 892 KB