A permanent algorithm with exp[Ω(n1/3/2 in n)] expected speedup for 0-1 matrices

Algorithmica (New York)

Volumn 32, Issue 1, 2002, Pages 157-162

  Bax, E ^a   Franklin, J ^b  

^a California Inst of Technol 217 50 ^*  (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

P; Algorithms; Combinatorial problems; Finite difference; Generating function; Permanent

Indexed keywords

EID: 0012251618     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0072-0     Document Type: Article

References (14)

1. E. Bax, Finite-difference algorithms for counting problems, CalTech-CS-TR-97-23.
2. E. Bax and J. Franklin, A finite-difference sieve to count paths and cycles by length, Inform. Process. Lett., 60 (1996), 171-176.
3. E. Bax and J. Franklin, A permanent formula with many zero-valued terms, Inform. Process. Lett., 63 (1997), 33-39.
4. M. R. Garey and D. S. Johnson, Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
5. J. M. Hammersley, An improved lower bound for the multidimensional dimer problem, Math Proc. Cambridge Philos. Soc., 64 (1968), 455-163.
6. W. Hoeffding, Probability inequalities for sums of bounded random variables, Amer. Statist. Assoc. J., 58(1963), 13-30.
7. M. R. Jerrum and A. Sinclair, Approximating the permanent, SIAM J. Comput., 18(6) (1989), 1149-1178.
8. M. Jerrum and U. Vazirani, A mildly exponential approximation algorithm for the permanent, Algorithmica, 16 (1996), 392-401.
9. N. Karmarkar, R. Karp, R. Lipton, L. Lovász, and M. Luby, A Monte Carlo algorithm for estimating the permanent, SIAM J. Comput., 22(2) (1993), 284-293.
10. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, 1995, pp. 315-329.
11. H. J. Ryser, Combinatorial Mathematics, The Mathematical Association of America, Washington, DC, 1963, Chapter 2.
12. J. Simon, On Some Central Problems in Computational Complexity, Doctoral Thesis, Department of Computer Science, Cornell University, Ithaca, NY.
13. A. Sinclair, Algorithms for Random Generation and Counting: A Markov Chain Approach, Birkhäuser, Boston, 1993.
14. L. G. Valiant, The complexity of computing the permanent, Theoret. Comput. Sci., 8 (1979), 189-201.