On the Hardness of Computing the Permanent of Random Matrices.

Uriel Feige Carsten Lund

Published in: Comput. Complex. (1997)

Keyphrases

database
phase transition
case study
search space
random instances
neural network
real world
learning algorithm
np hard
worst case
singular value decomposition
satisfiability problem
randomly generated