✦ LIBER ✦

A tight bound for 3-partitioning

✍ Scribed by Hans Kellerer; Gerhard Woeginger

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 608 KB
Volume: 45
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90013-e

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight bound for matching

✍ Yijie Han 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 423 KB

Tight lower bounds for Shellsort

✍ Mark Allen Weiss; Robert Sedgewick 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Bounded tightness for weak topologies

✍ B. Cascales; M. Raja 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 119 KB

A tight bound for approximating the squa

A tight bound for approximating the square root

✍ Nader H. Bshouty; Yishay Mansour; Baruch Schieber; Prasoon Tiwari 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 285 KB

We prove an R (log log( l/c) ) lower bound on the depth of any computation tree and any RAM program with operations {+, -, \*, /, [.j, not, and, br, xor}, unlimited power of answering YES/NO questions, and constants (0.1) that computes 4 to accuracy E, for all x E [ 1,2]. Since the Newton method ach

A tight lower bound for restricted pir p

A tight lower bound for restricted pir protocols

✍ Richard Beigel; Lance Fortnow; William Gasarch 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 140 KB

Almost tight bounds forɛ-Nets

✍ János Komlós; János Pach; Gerhard Woeginger 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 645 KB