CORR
1999
Springer
13 years 4 months ago
1999
Springer
CORR
1999
Springer
13 years 4 months ago
1999
Springer
A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be rotated into any member of S. We present a hinged dissection...
CORR
1999
Springer
13 years 4 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
CORR
1999
Springer
13 years 4 months ago
1999
Springer
CORR
1999
Springer
13 years 4 months ago
1999
Springer
CORR
1999
Springer
13 years 4 months ago
1999
Springer
CORR
1999
Springer
13 years 4 months ago
1999
Springer
CORR
1999
Springer
13 years 4 months ago
1999
Springer
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
CORR
1999
Springer
13 years 4 months ago
1999
Springer
: We introduce a generalization of Selman's P-selectivity that yields a more exible notion of selectivity, called polynomial-time multi-selectivity, in which the
CORR
1999
Springer
13 years 4 months ago
1999
Springer
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...