ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...