✦ LIBER ✦

Approximating Tverberg Points in Linear Time for Any Fixed Dimension

✍ Scribed by Wolfgang Mulzer, Daniel Werner

Book ID: 120910122
Publisher: Springer
Year: 2013
Tongue: English
Weight: 255 KB
Volume: 50
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-013-9528-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear-Time Test for Small Face Covers i

Linear-Time Test for Small Face Covers in any Fixed Surface

✍ Bienstock, D. 📂 Article 📅 1990 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 687 KB

On Linear-Time Deterministic Algorithms

On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension

✍ Bernard Chazelle; Jiřı́ Matoušek 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 208 KB

We show that with recently developed derandomization techniques, one can convert Clarkson's randomized algorithm for linear programming in fixed dimension into a linear-time deterministic algorithm. The constant of proportionality is d O Ž d . , which is better than those for previously known algori

Computing the Hausdorff set distance in

Computing the Hausdorff set distance in linear time for any Lp point distance

✍ R. Shonkwiler 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 818 KB

Finite element approximations for a line

Finite element approximations for a linear fourth-order parabolic SPDE in two and three space dimensions with additive space–time white noise

✍ Kossioris, Georgios T.; Zouraris, Georgios E. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 331 KB

[IEEE 1993 IEEE 34th Annual Foundations

[IEEE 1993 IEEE 34th Annual Foundations of Computer Science - Palo Alto, CA, USA (3-5 Nov. 1993)] Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science - A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed

✍ Barvinok, A.I. 📂 Article 📅 1993 🏛 IEEE ⚖ 521 KB