On the hardness of approximating the permanent of structured matrices

10.1007/s00037-002-0174-3

Saved in:
Bibliographic Details
Main Authors: Codenotti, B., Shparlinski, I.E., Winterhof, A.
Other Authors: TEMASEK LABORATORIES
Format: Article
Published: 2016
Subjects:
Online Access:http://scholarbank.nus.edu.sg/handle/10635/132773
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore
id sg-nus-scholar.10635-132773
record_format dspace
spelling sg-nus-scholar.10635-1327732023-10-26T08:50:42Z On the hardness of approximating the permanent of structured matrices Codenotti, B. Shparlinski, I.E. Winterhof, A. TEMASEK LABORATORIES Approximation of the permanent Exponential sums Hidden number problem 10.1007/s00037-002-0174-3 Computational Complexity 11 3-4 158-170 2016-12-13T05:36:22Z 2016-12-13T05:36:22Z 2002 Article Codenotti, B., Shparlinski, I.E., Winterhof, A. (2002). On the hardness of approximating the permanent of structured matrices. Computational Complexity 11 (3-4) : 158-170. ScholarBank@NUS Repository. https://doi.org/10.1007/s00037-002-0174-3 10163328 http://scholarbank.nus.edu.sg/handle/10635/132773 000186953300004 Scopus
institution National University of Singapore
building NUS Library
continent Asia
country Singapore
Singapore
content_provider NUS Library
collection ScholarBank@NUS
topic Approximation of the permanent
Exponential sums
Hidden number problem
spellingShingle Approximation of the permanent
Exponential sums
Hidden number problem
Codenotti, B.
Shparlinski, I.E.
Winterhof, A.
On the hardness of approximating the permanent of structured matrices
description 10.1007/s00037-002-0174-3
author2 TEMASEK LABORATORIES
author_facet TEMASEK LABORATORIES
Codenotti, B.
Shparlinski, I.E.
Winterhof, A.
format Article
author Codenotti, B.
Shparlinski, I.E.
Winterhof, A.
author_sort Codenotti, B.
title On the hardness of approximating the permanent of structured matrices
title_short On the hardness of approximating the permanent of structured matrices
title_full On the hardness of approximating the permanent of structured matrices
title_fullStr On the hardness of approximating the permanent of structured matrices
title_full_unstemmed On the hardness of approximating the permanent of structured matrices
title_sort on the hardness of approximating the permanent of structured matrices
publishDate 2016
url http://scholarbank.nus.edu.sg/handle/10635/132773
_version_ 1781790924048695296