✦ LIBER ✦

An improved lower bound for rank four scheduling

✍ Scribed by Chen, Lin; Ye, Deshi; Zhang, Guochuan

Book ID: 125802084
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 342 KB
Volume: 42
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2014.06.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved lower bound for a bi-criteri

An improved lower bound for a bi-criteria scheduling problem

✍ Jin Yan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 133 KB

An Improved Lower Bound for Sorting Netw

An Improved Lower Bound for Sorting Networks

✍ Van Voorhis, David C. 📂 Article 📅 1972 🏛 IEEE 🌐 English ⚖ 345 KB

An improved BL lower bound

✍ Donna J. Brown 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 334 KB

A Lower Bound for Scheduling Mechanisms

✍ George Christodoulou; Elias Koutsoupias; Angelina Vidali 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 304 KB

An improved time-space lower bound for t

An improved time-space lower bound for tautologies

✍ Scott Diehl; Dieter van Melkebeek; Ryan Williams 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 507 KB

Improved bound for rank revealing LU fac

Improved bound for rank revealing LU factorizations

✍ Tsung-Min Hwang; Wen-Wei Lin; Daniel Pierce 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 606 KB

In many applications it is necessary to determine the rank (or numerical rank) of a matrix. Many of these situations involve matrices that are very large order or that are sparse or that may undergo some form of modification (rank-k update, row or column appended or removed). In these cases the sing