Computation of sparse circulant permanents via determinants

Linear Algebra and Its Applications

Volumn 355, Issue 1-3, 2002, Pages 15-34

  Codenotti, B ^a   Resta, G ^a  

^a CNR   (Italy)

Author keywords

Circulant matrix; Determinant; Genus; Perfect matching; Permanent

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; VECTORS;

CIRCULAR MATRIX; DETERMINANT; GENUS; PERFECT MATCHING; PERMANENT;

MATRIX ALGEBRA;

EID: 0142092864     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(02)00330-0     Document Type: Article

References (23)

1. Bernasconi A., Codenotti B., Crespi V., Resta G. How fast can one compute the permanent of circulant matrices? Linear Algebra Appl. 292(1-3):1999;15-37.
2. Codenotti B., Crespi V., Resta G. On the permanent of certain (0, 1) Toeplitz matrices Linear Algebra Appl. 267:1997;65-100.
3. P. Dagum, M. Luby, M. Mihail, U. Vazirani, Polytopes, permanents, and graphs with large factors, in: Proceedings of the 27th IEEE Symposium on Foundation of Computer Science, 1988.
4. U. Feige, C. Lund, On the hardness of computing the permanent of random matrices, in: Proceedings of the 24th ACM Symposium on the Theory of Computation, 1992, pp. 643-654.
5. Galluccio A., Loebl M. On the theory of Pfaffian orientations. I. Perfect matchings and permanents. Electron. J. Combin. 6(1):1999;. Research Paper 6.
6. Galluccio A., Loebl M. On the theory of pfaffian orientations. T-joins, k-cuts, and duality of enumeration. Electron. J. Combin. 6(1):1999;. Research Paper 7.
7. Galluccio A., Loebl M., Vondrák J. New algorithm for the ising problem: partition function for finite lattice graphs. Phys. Rev. Lett. 84(26):2000;5924-5927.
8. Galluccio A., Loebl M., Vondràk J. Optimization via enumeration: a new algorithm for the max cut problem. Math. Programming. 90(2):2001;273-290.
9. Kac M., Ward J.C. A Combinatorial solution of the two dimensional ising model. Phys. Rev. 88(6):1952;1332-1337.
10. Kasteleyn P.W. The statistics of dimers on a lattice I. The number of dimers arrangements on a quadratic lattice. Physica. 27:1961;1209-1225.
11. Kasteleyn P.W. Dimer statistics and phase transitions. J. Math. Phys. 4:1963;287-293.
12. P.W. Kasteleyn, Graph theory and crystal physics, in: F. Harary (Ed.), Graph Theory and Theoretical Physics, 1967.
13. L. Lovasz, M.D. Plummer, Matching Theory, Annals of Discrete Mathematics, vol. 29, North-Holland, Amsterdam, 1986.
14. W. McCuaig, N. Robertson, P.D. Seymour, R. Thomas, Permanents, Pfaffian orientations, and even directed circuits (extended abstract), in: Proceedings of the 29th ACM Symposium on the Theory of Computation, 1997, pp. 402-405.
15. Minc H. Recurrence formulas for permanents of (0, 1) circulants Linear Algebra Appl. 71:1985;241-265.
16. Minc H. Permanental compounds and permanents of (0, 1) circulants Linear Algebra Appl. 86:1987;11-42.
17. Polya G. Aufgabe 424. Arch. Math. Phys. 3, 20:1913;27.
18. Regge T., Zecchina R. Exact solution of the ising model on group lattices of genus. g > 1 J. Math. Phys. 37:1996;2796.
19. Regge T., Zecchina R. Combinatorial and topological approach to the 3D Ising model. J. Phys. A. 33:2000;741-761.
20. H.J. Ryser, Combinatorial Mathematics, Carus Mathematical Monograph No. 14, 1963.
21. Tesler G. Matchings in graphs on non-orientable surfaces. J. Combin. Theory B. 78:2000;198-231.
22. Valiant L.G. The complexity of computing the permanent. Theoret. Comput. Sci. 8:1979;189-201.
23. L.G. Valiant, Completeness classes in algebra, in: Proceedings of the 10th ACM Symposium on the Theory of Computation, 1979, pp. 249-261.