ISAAC
1993
Springer
14 years 3 months ago
1993
Springer
ISAAC
1993
Springer
14 years 3 months ago
1993
Springer
ISAAC
1993
Springer
14 years 3 months ago
1993
Springer
We present the first polynomial time algorithm that finds the shortest route in a simple polygon such that all points of the polygon are visible from the route. This route is cal...
ISAAC
1993
Springer
14 years 3 months ago
1993
Springer
COCO
1992
Springer
14 years 3 months ago
1992
Springer
COCO
1992
Springer
14 years 3 months ago
1992
Springer
We give a novel characterization of W[1], the most important fixed-parameter intractability class in the W-hierarchy, using Boolean circuits that consist solely of majority gates. ...
COCO
1992
Springer
14 years 3 months ago
1992
Springer
COCO
1992
Springer
14 years 3 months ago
1992
Springer
COCO
1992
Springer
14 years 3 months ago
1992
Springer
We characterize the classes of functions computable by uniform log-depth (NC1) and polylog-depth circuit families as closures of a set of base functions. (The former is equivalent...
COCO
1992
Springer
14 years 3 months ago
1992
Springer