50 search results - page 1 / 10 » Hausdorff Dimension in Exponential Time |
COCO
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we investigate effective versions of Hausdorff dimension which have been recently introduced by Lutz. We focus on dimension in the class E of sets computable in line...
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
COCO
2004
Springer
13 years 8 months ago
2004
Springer
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
COMPGEOM
2009
ACM
13 years 9 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
IWPEC
2009
Springer
13 years 11 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...