✦ LIBER ✦

Calculating lower bounds for caching problems

✍ Scribed by L. Epstein; R. van Stee

Publisher: Springer Vienna
Year: 2007
Tongue: English
Weight: 100 KB
Volume: 80
Category: Article
ISSN: 0010-485X
DOI: 10.1007/s00607-007-0230-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for arithmetic problems

✍ João Meidânis 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 543 KB

Lower bounds for single-machine scheduli

Lower bounds for single-machine scheduling problems

✍ Reza H. Ahmadi; Uttarayan Bagchi 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 588 KB

Lower bounds for combinatorial problems

Lower bounds for combinatorial problems on graphs

✍ Hiroyuki Nakayama; Takao Nishizeki; Nobuji Saito 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 375 KB

Lower bounds for polynomial evaluation a

Lower bounds for polynomial evaluation and interpolation problems

✍ Victor Shoup; Roman Smolensky 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 468 KB

Lower bounds for maximal and convex laye

Lower bounds for maximal and convex layers problems

✍ Sanjiv Kapoor; Prakash Ramanan 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 668 KB

Lower Bounds in Minimum Rank Problems

✍ Lon H. Mitchell; Sivaram K. Narayan; Andrew M. Zimmer 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 186 KB

The minimum rank of a graph is the smallest possible rank among all real symmetric matrices with the given graph. The minimum semidefinite rank of a graph is the minimum rank among Hermitian positive semidefinite matrices with the given graph. We explore connections between OS-sets and a lower bound