IIT Home Page CNR Home Page

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 prime p is as hard as computing its exact value. Results of this kind are well known for arbitrary matrices. However the techniques used do not seem to apply to "structured" matrices. Our approach is based on recent advances in the hidden number problem introduced by Boneh and Venkatesan in 1996 combined with some bounds of exponential sums motivated by the Waring problem in finite fields.
COMPUTATIONAL COMPLEXITY (11387J0), 2003

Autori: Codenotti B.,Shparlinski I., Winterhof A.
Autori IIT:

Tipo: Articoli su riviste ISI
pubblicato nel 2003 Da pagina 158 a pagina 170