✦ LIBER ✦

Lower bounds on the length of monotone paths in arrangements

✍ Scribed by Jiří Matoušek

Book ID: 110561384
Publisher: Springer
Year: 1991
Tongue: English
Weight: 262 KB
Volume: 6
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02574679

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound on the average shortest pa

A lower bound on the average shortest path length in regular graphs

✍ V. G. Cerf; D. D. Cowan; R. C. Mullin; R. G. Stanton 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 226 KB

Lower bounds on monotone complexity of t

Lower bounds on monotone complexity of the logical permanent

✍ A. A. Razborov 📂 Article 📅 1985 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 619 KB

Lower Bounds on the Depth of Monotone Ar

Lower Bounds on the Depth of Monotone Arithmetic Computations

✍ Don Coppersmith; Baruch Schieber 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 128 KB

dedicated to zvi galil's 50th birthday Consider an arithmetic expression of length n involving only the operations [+, \_] and non-negative constants. We prove lower bounds on the depth of any binary computation tree over the same sets of operations and constants that computes such an expression. We

Tight lower bounds on the length of word

Tight lower bounds on the length of word chains

✍ Ingo Althöfer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 113 KB

Bounds on the weighted path length of bi

Bounds on the weighted path length of binary trees

✍ J. Nievergelt; J. Pradels; C.K. Wong; P.C. Yue 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 708 KB

Improved lower bounds on the length of D

Improved lower bounds on the length of Davenport-Schinzel sequences

✍ Micha Sharir 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 421 KB