✦ LIBER ✦

Complexity analysis of a linear complementarity algorithm based on a Lyapunov function

✍ Scribed by Paul Tseng

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the solution and complexity of a gene

✍ J. J. Júdice; L. N. Vicente 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 398 KB

Stability of self-tuning control based o

✍ A. Patete; K. Furuta; M. Tomizuka 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB 👁 2 views

A polynomial-time algorithm for linear o

✍ M. El Ghami; I. Ivanov; J.B.M. Melissen; C. Roos; T. Steihaug 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 721 KB

On the complexity of a piecewise linear

✍ James Renegar 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 672 KB

A developed algorithm of apriori based o

✍ Li Pingxiang; Chen Jiangping; Bian Fuling 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 382 KB

On a signal processing algorithms based

✍ Hari Krishna 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 960 KB