A permanent formula with many zero-valued terms

Information Processing Letters

Volumn 63, Issue 1, 1997, Pages 33-39

  Bax, Eric ^a   Franklin, Joel ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

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

Indexed keywords

EID: 0004605653     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00078-1     Document Type: Article

References (9)

1. E. Bax, Tailoring the permanent formula to problem instances, Tech. Rept. CalTech-CS-TR-96-17.
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 finite-difference sieve to compute the permanent. Tech. Rept. CalTech-CS-TR-96-04.
4. E. Bax and J. Franklin, Expected fraction of zero-valued terms in a finite-difference formula for the permanent. Tech. Rept. CalTech-CS-TR-97-02.
5. M.R. Jerrum and A. Sinclair, Approximating the permanent, SIAM J. Comput. 18 (6) (1989) 1149-1178.
6. M. Jerrum and U. Vazirani, A mildly exponential approximation algorithm for the permanent, Algorithmica 16 (1996) 392-401.
7. 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.
8. H.J. Ryser, Combinatorial Mathematics (The Mathematical Association of America, 1963), Chapter 2.
9. L.G. Valiant, The complexity of computing the permanent, Theoret. Comput. Sci. 8 (1979) 189-201.