✦ LIBER ✦

Lower bounds for weak Byzantine agreement

✍ Scribed by Dingzhu Du

Book ID: 112665875
Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 1989
Tongue: English
Weight: 890 KB
Volume: 5
Category: Article
ISSN: 0168-9673
DOI: 10.1007/bf02005956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bound for scalable Byzantine Agree

Lower bound for scalable Byzantine Agreement

✍ Dan Holtby; Bruce M. Kapron; Valerie King 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 185 KB

Lower bounds for weak sense of direction

✍ Paolo Boldi; Sebastiano Vigna 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Efficient Algorithms for Anonymous Byzan

Efficient Algorithms for Anonymous Byzantine Agreement

✍ Michael Okun; Amnon Barak 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 428 KB

Lower bounds for weak epsilon-nets and s

Lower bounds for weak epsilon-nets and stair-convexity

✍ Boris Bukh; Jiří Matoušek; Gabriel Nivasch 📂 Article 📅 2011 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 623 KB

Regular Resolution Lower Bounds For The

Regular Resolution Lower Bounds For The Weak Pigeonhole Principle

✍ Toniann Pitassi*; Ran Raz† 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 275 KB

Resolution lower bounds for the weak fun

Resolution lower bounds for the weak functional pigeonhole principle

✍ Alexander A. Razborov 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 243 KB

We show that every resolution proof of the functional version FPHP m n of the pigeonhole principle (in which one pigeon may not split between several holes) must have size exp( (n=(log m) 2 )). This implies an exp( (n 1=3 )) bound when the number of pigeons m is arbitrary.