Sciweavers

734 search results - page 9 / 147
» A polynomial quantum algorithm for approximating the Jones p...
Sort
View
COCOON
2006
Springer
14 years 9 days ago
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
Marc Benkert, Joachim Gudmundsson, Christian Knaue...
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
13 years 8 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof