Bruno Codenotti, Igor Shparlinski, Arne Winterhof. On the hardness of approximating the permanent of structured matrices. Computational Complexity, 11(3-4):158-170, 2002. [doi]
No references recorded for this publication.
No citations of this publication recorded.