✦ LIBER ✦

A lower bound on Voronoi diagram complexity

✍ Scribed by Boris Aronov

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 49 KB
Volume: 83
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(01)00336-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximizing a lower bound on the computat

Maximizing a lower bound on the computational complexity

✍ Georg Gati 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 294 KB

How to derive a quantum complexity lower

How to derive a quantum complexity lower bound

✍ Tetsuro Nishino 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB 👁 1 views

A linear lower bound on the unbounded er

A linear lower bound on the unbounded error probabilistic communication complexity

✍ Jürgen Forster 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 187 KB

The main mathematical result of this paper may be stated as follows: Given a matrix MAfÀ1; 1g nÂn and any matrix MAR nÂn such that signð Mi;j Þ ¼ M i;j for all i; j; then rankð MÞXn=jjMjj: Here jjMjj denotes the spectral norm of the matrix M: This implies a general lower bound on the complexity of

A 3n-lower bound on the network complexi

A 3n-lower bound on the network complexity of Boolean functions

✍ C.P. Schnorr 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 972 KB

Lower Bounds on the Multiparty Communica

Lower Bounds on the Multiparty Communication Complexity

✍ Pavol Ďuriš; José D.P. Rolim 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 236 KB

A lower bound for the topological comple

A lower bound for the topological complexity of poly(D,n)

✍ Harold Levine 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 646 KB