✦ LIBER ✦

A note on the complexity ofLpminimization

✍ Scribed by Dongdong Ge; Xiaoye Jiang; Yinyu Ye

Book ID: 106276027
Publisher: Springer-Verlag
Year: 2011
Tongue: English
Weight: 231 KB
Volume: 129
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-011-0470-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the best-case complexity

✍ JoséD.P. Rolim; Sheila A. Greibach 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 817 KB

A note on the complexity of program eval

A note on the complexity of program evaluation

✍ Oscar H. Ibarra; Brian S. Leininger; Louis E. Rosier 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 846 KB

A note on the complexity of algebraic di

A note on the complexity of algebraic differentation

✍ B.F. Caviness; H.I. Epstein 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 359 KB

A note on the complexity of cryptography

A note on the complexity of cryptography (Corresp.)

✍ Brassard, G. 📂 Article 📅 1979 🏛 IEEE 🌐 English ⚖ 380 KB

A note on the complexity of a partition

A note on the complexity of a partition algorithm

✍ Vladimir Lifschitz; Leon Pesotchinsky 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Note on reliability of a system complexi

Note on reliability of a system complexity

✍ T. Nakagawa; K. Yasui 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 419 KB

Most systems have been recently complicated with remarkable development of their high performances. Both hardware and softavare become redundant, and sometimes, serious problems of interference between them might be newly generated. It would be inappropriate to calculate the reliabilities of such co