On the number of different permanents of some sparse (0, 1) -circulant matrices

Linear Algebra and Its Applications

Volumn 375, Issue 1-3, 2003, Pages 197-209

  Resta, Giovanni ^a   Sburlati, Giovanni ^a  

^a Istituto di informatica e telematica del Consiglio nazionale delle ricerche   (Italy)

Author keywords

Matrix permanent; Sparse circulant matrix

Indexed keywords

ASYMPTOTIC STABILITY; POLYNOMIALS; PROBLEM SOLVING;

CIRCULAR MATRICES;

MATRIX ALGEBRA;

EID: 0142126161     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(03)00649-9     Document Type: Article

References (9)

1. A. Bernasconi, B. Codenotti, V. Crespi, G. Resta, How fast can one compute the permanent of circulant matrices? Linear Algebra Appl. 292 (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. Codenotti B., Resta G. Computation of sparse circulant permanents via determinants. Linear Algebra Appl. 355:2002;15-34.
4. Dagum P., Luby M., Mihail M., Vazirani U. Polytopes, permanents and graphs with large factors. Proc. 29th IEEE Sympos. Found. Comput. Sci. 1988;412-421.
5. LeVeque W.J. Fundamentals of Number Theory. 1996;Dover Publications.
6. Niven I., Zuckerman H.S. An Introduction to the Theory of Numbers. 1980;John Wiley.
7. H.J. Ryser, Combinatorial Mathematics, Carus Mathematical Monograph No. 14, 1963.
8. Valiant L.G. The complexity of computing the permanent. Theoret. Comput. Sci. 8:1979;189-201.
9. Valiant L.G. Completeness classes in algebra. ACM Sympos. Theory Comput. 1979;249-261.