DocumentCode :
1566528
Title :
A mildly exponential approximation algorithm for the permanent
Author :
Jerrum, Mark ; Vazirani, Umesh
Author_Institution :
Dept. of Comput. Sci., Edinburgh Univ., UK
fYear :
1992
Firstpage :
320
Lastpage :
326
Abstract :
An approximation algorithm for the permanent of an n×n 0,1-matrix is presented. The algorithm is shown to have worst-case time complexity exp (0(n1/2 log2 n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worst-case time complexity of the form eθ(n)
Keywords :
computational complexity; matrix algebra; matrix permanent; mildly exponential approximation algorithm; permanent; worst-case time complexity; Approximation algorithms; Bipartite graph; Computer science; Mathematics; Monte Carlo methods; NP-hard problem; Polynomials; Random variables; Turing machines;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on
Conference_Location :
Pittsburgh, PA
Print_ISBN :
0-8186-2900-2
Type :
conf
DOI :
10.1109/SFCS.1992.267759
Filename :
267759
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1566528
بازگشت