On the hardness of approximating the permanent of structured matrices.

Bruno Codenotti Igor E. Shparlinski Arne Winterhof

Published in: Comput. Complex. (2002)

Keyphrases

structured data
np complete
singular value decomposition
data sets
real world
information theoretic
phase transition
pairwise comparison
feature selection
website
bayesian networks
rows and columns
sparse matrix
matrix multiplication