✦ LIBER ✦

NP-Completeness of the linear complementarity problem

✍ Scribed by S. J. Chung

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

NP-completeness of the hamming salesman

✍ Jarmo Ernvall; Jyrki Katajainen; Martti Penttonen 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 211 KB

Some NP-complete problems in linear prog

✍ R. Chandrasekaran; Santosh N. Kabadi; Katta G. Murthy 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 342 KB

The NP-Completeness of the bandwidth min

✍ Ch. H. Papadimitriou 📂 Article 📅 1976 🏛 Springer Vienna 🌐 English ⚖ 375 KB

Strong NP-completeness of a matrix simil

✍ V. Brimkov; B. Codenotti; M. Leoncini; G. Resta 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 469 KB

The Linear Dynamic Complementarity Probl

✍ Bart De Schutter; Bart De Moor 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 108 KB

Equivalence of the Generalized Vertical

✍ Bidushi Chakraborty; Sudarshan Nanda; Mahendra Prasad Biswal 📂 Article 📅 2005 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 185 KB