𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A role of lower semicontinuous functions in the combinatorial complexity of geometric problems

✍ Scribed by Jerzy W Jaromczyk; Grzegorz Świştek

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
583 KB
Volume
7
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of some geometric prob
On the complexity of some geometric problems in unbounded dimension
✍ Nimrod Megiddo 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 429 KB

This paper examines the complexity of several geometric problems due to unbounded dimension. The problems considered are: (i) minimum cover of points by unit cubes, (ii) minimum cover of points by unit ball% and (iii) minimum number of lines to hit a set of balls. Each of these problems is proven no

Lower Bounds for the Complexity of Funct
Lower Bounds for the Complexity of Functions in a Realistic RAM Model
✍ Nader H. Bshouty 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 127 KB

This paper develops a new technique that finds almost tight lower bounds for the complexity of programs that compute or approximate functions in a realistic RAM model. The nonuniform realistic RAM model is a model that uses the arithmetic Ä 4 operations q, y, = , the standard bit operation Shift, Ro