✦ LIBER ✦

Parallel time and space upper-bounds for the subset-sum problem

✍ Scribed by C.A.A. Sanches; N.Y. Soma; H.H. Yanasse

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel approximation schemes for Subse

✍ Joseph G. Peters; Larry Rudolph 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 890 KB

A Fast Approximation Algorithm for the S

✍ Bartosz Przydatek 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 746 KB

Upper bounds for time-space trade-offs i

✍ Greg N. Frederickson 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 561 KB

Optimal parallel time bounds for the max

✍ Lin Chen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 293 KB

Approximation schemes for the subset-sum

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 744 KB

Bounds and asymptotic results for the un

✍ S.T. Webster 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 269 KB