Computing sparse permanents faster

Information Processing Letters

Volumn 96, Issue 3, 2005, Pages 89-92

  Servedio, Rocco A ^a   Wan, Andrew ^a  

^a Columbia University ^*  (United States)

Author keywords

Algorithms; Combinatorial problems; Computational complexity

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; PROBLEM SOLVING;

COMBINATORIAL PROBLEMS; ZERO-ONE MATRIX;

COMPUTATIONAL METHODS;

EID: 24344474146     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.06.007     Document Type: Article

References (4)

1. E. Bax, and J. Franklin A permanent algorithm with exp [ ω (n 1 / 3 / 2 ln n ) ] expected speedup for 0-1 matrices Algorithmica 32 2002 157 162
2. M. Jerrum, A. Sinclair, E. Vigoda, A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries, in: Proc. 33rd Annual Symp. on Theory of Computing, 2001, pp. 712-721
3. H.J. Ryser Combinatorial Mathematics Carus Mathematical Monographs vol. 14 1963 Wiley New York
4. L. Valiant The complexity of computing the permanent Theoret. Comput. Sci. 8 1979 189 201