✦ LIBER ✦

Computational lower bounds using diagonalization

✍ Scribed by M. V. Panduranga Rao

Book ID: 107589726
Publisher: Indian Academy of Sciences
Year: 2009
Tongue: English
Weight: 240 KB
Volume: 14
Category: Article
ISSN: 0971-8044
DOI: 10.1007/s12045-009-0056-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational lower bounds using diagona

Computational lower bounds using diagonalization — II

✍ M. V. Panduranga Rao 📂 Article 📅 2010 🏛 Indian Academy of Sciences 🌐 English ⚖ 192 KB

Lower bounds for small diagonal ramsey n

Lower bounds for small diagonal ramsey numbers

✍ James B Shearer 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 129 KB

Low Complexity MIMO Scheduling with Bloc

Low Complexity MIMO Scheduling with Block Diagonalization Using Capacity Lower-Bound

✍ Yang Yang; Xun Luo; Shaoqian Li 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 258 KB

Computing Semidefinite Programming Lower

Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization

✍ Gvozdenović, Nebojša; Laurent, Monique 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 309 KB

Constructive lower bounds for off-diagon

Constructive lower bounds for off-diagonal Ramsey numbers

✍ Noga Alon; Pavel Pudlák 📂 Article 📅 2001 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 391 KB

New lower bounds of some diagonal Ramsey

New lower bounds of some diagonal Ramsey numbers

✍ Filip Guldan; Pavel Tomasta 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB 👁 1 views

A new construction of self-complementary graphs containing no Klo or K , is described. This construction gives the Ramsey number lower bounds r(10,lO) 2 458 and r(1 1,l 1 ) 2 542. The problem of determining the Ramsey numbers is known to be very difficult and so we are often satisfied with partial