AbstractWe obtain convenient expressions and/or efficient algorithms for the permanent of certain very sparse (0, 1) Toeplitz matrices. The classes of matrices considered here include some nontrivial examples of circulants to which none of the previous approaches could be successfully applied
We show that for several natural classes of "structured" matrices, including symmetric, circulant, H...
AbstractStarting from recent formulas for calculating the permanents of some sparse circulant matric...
Starting from known results about the number of possible values for the permanents of $(0,1)$-circul...
AbstractWe obtain convenient expressions and/or efficient algorithms for the permanent of certain ve...
AbstractIn this paper we address the problem of computing the permanent of (0,1)-circulant matrices....
In this paper we address the problem of computing the permanent of (0,1)-circulant matrices. We inve...
AbstractWe consider the problem of computing the permanent of circulant matrices. We apply some rece...
We consider the problem of computing the permanent of circulant matrices. We apply some recent resul...
The permanent of an n x n matrix A = (a;j) is the matrix function ( 1) per A = ∑ al1r(1)••• a .. ,(...
AbstractIt is shown that the permanent function of (0, 1)-matrices is a complete problem for the cla...
AbstractStarting from known results about the number of possible values for the permanents of (0,1)-...
AbstractIt was shown by the author in a recent paper that a recurrence relation for permanents of (0...
AbstractWe present a new efficient method for computing the permanent and Hafnian of certain banded ...
AbstractA general method is developed for constructing linear recurrence formulas expressing the per...
AbstractA novel upper bound for the permanent of (0,1)-matrices is obtained in this paper, by using ...
We show that for several natural classes of "structured" matrices, including symmetric, circulant, H...
AbstractStarting from recent formulas for calculating the permanents of some sparse circulant matric...
Starting from known results about the number of possible values for the permanents of $(0,1)$-circul...
AbstractWe obtain convenient expressions and/or efficient algorithms for the permanent of certain ve...
AbstractIn this paper we address the problem of computing the permanent of (0,1)-circulant matrices....
In this paper we address the problem of computing the permanent of (0,1)-circulant matrices. We inve...
AbstractWe consider the problem of computing the permanent of circulant matrices. We apply some rece...
We consider the problem of computing the permanent of circulant matrices. We apply some recent resul...
The permanent of an n x n matrix A = (a;j) is the matrix function ( 1) per A = ∑ al1r(1)••• a .. ,(...
AbstractIt is shown that the permanent function of (0, 1)-matrices is a complete problem for the cla...
AbstractStarting from known results about the number of possible values for the permanents of (0,1)-...
AbstractIt was shown by the author in a recent paper that a recurrence relation for permanents of (0...
AbstractWe present a new efficient method for computing the permanent and Hafnian of certain banded ...
AbstractA general method is developed for constructing linear recurrence formulas expressing the per...
AbstractA novel upper bound for the permanent of (0,1)-matrices is obtained in this paper, by using ...
We show that for several natural classes of "structured" matrices, including symmetric, circulant, H...
AbstractStarting from recent formulas for calculating the permanents of some sparse circulant matric...
Starting from known results about the number of possible values for the permanents of $(0,1)$-circul...
DOI
Add to ORKG