Sciweavers

2766 search results - page 138 / 554
» Algorithms for trigonometric polynomials
Sort
View
APPROX
2007
Springer
102views Algorithms» more  APPROX 2007»
15 years 10 months ago
Hardness of Embedding Metric Spaces of Equal Size
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
Subhash Khot, Rishi Saket
CHES
2005
Springer
83views Cryptology» more  CHES 2005»
15 years 9 months ago
Fast Truncated Multiplication for Cryptographic Applications
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
Laszlo Hars
ICALP
2003
Springer
15 years 9 months ago
Generating Labeled Planar Graphs Uniformly at Random
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
WG
2001
Springer
15 years 8 months ago
Approximation of Pathwidth of Outerplanar Graphs
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an alg...
Fedor V. Fomin, Hans L. Bodlaender
ISAAC
1993
Springer
87views Algorithms» more  ISAAC 1993»
15 years 8 months ago
Finding the Shortest Watchman Route in a Simple Polygon
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...
Svante Carlsson, Håkan Jonsson, Bengt J. Nil...