✦ LIBER ✦

Solving a class of optimum multiuser detection problems with polynomial complexity

✍ Scribed by Sankaran, C.; Ephremides, A.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On computing Verdu's upper bound for a c

✍ Wing-Kin Ma; Wong, K.M.; Ching, P.C. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 310 KB

A family of likelihood ascent search mul

✍ Yi Sun 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 456 KB

Polynomial-time algorithms for solving a

✍ Siqian Shen; J. Cole Smith 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 367 KB 👁 1 views

On the complexity of a class of combinat

✍ Igor Averbakh 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 110 KB

Solving the problem of a radially inhomo

✍ Shyam Kaushal, Radhey 📂 Article 📅 1991 🏛 Optical Society of America 🌐 English ⚖ 301 KB

Solving the general problem of linear ti

✍ A. A. Bolonkin 📂 Article 📅 1968 🏛 Springer US 🌐 English ⚖ 556 KB