Sciweavers

CC
2002
Springer
126views System Software» more  CC 2002»
14 years 8 days ago
On the hardness of approximating the permanent of structured matrices
We show that for several natural classes of "structured" matrices, including symmetric, circulant, Hankel and Toeplitz matrices, approximating the permanent modulo a prim...
Bruno Codenotti, Igor Shparlinski, Arne Winterhof
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
14 years 11 days 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