AbstractA novel upper bound for the permanent of (0,1)-matrices is obtained in this paper, by using an unbiased estimator of permanent [Random Structures Algorithms 5 (1994) 349]. It is a refinement of Minc’s very famous result, and apparently tighter than the current best general bound in some cases
AbstractWe show that the permanent of an n×n matrix with iid Bernoulli entries ±1 is of magnitude n(...
Let A be a square matrix over an arbitrary field. The permanent of the matrix A is defined as the al...
AbstractLet U(n, τ) be the set of all matrices of 0′s and 1′s of order n with exactly τ 0′s. We obta...
AbstractWe investigate an old suggestion of A.E. Brouwer we call decomposition, for constructing a c...
AbstractA novel upper bound for the permanent of (0,1)-matrices is obtained in this paper, by using ...
AbstractIn this paper we investigate the values of permanents according to the positions of zeros ov...
Abstract Despite its apparent similarity to the (easily-computable) determinant, it is believed that...
AbstractLet Pnk be the maximum value achieved by the permanent over Λnk, the set of (0,1)-matrices o...
AbstractIt is shown that the permanent function of (0, 1)-matrices is a complete problem for the cla...
AbstractWe obtain convenient expressions and/or efficient algorithms for the permanent of certain ve...
By calculating the permanents for all Hadamard matrices of orders up to and including 28 we answer a...
In this paper we address the problem of computing the permanent of (0,1)-circulant matrices. We inve...
AbstractA recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, st...
Abstract. A new approximation algorithm for the permanent of an n × n 0,1-matrix is presented. The a...
AbstractIn this paper we address the problem of computing the permanent of (0,1)-circulant matrices....
AbstractWe show that the permanent of an n×n matrix with iid Bernoulli entries ±1 is of magnitude n(...
Let A be a square matrix over an arbitrary field. The permanent of the matrix A is defined as the al...
AbstractLet U(n, τ) be the set of all matrices of 0′s and 1′s of order n with exactly τ 0′s. We obta...
AbstractWe investigate an old suggestion of A.E. Brouwer we call decomposition, for constructing a c...
AbstractA novel upper bound for the permanent of (0,1)-matrices is obtained in this paper, by using ...
AbstractIn this paper we investigate the values of permanents according to the positions of zeros ov...
Abstract Despite its apparent similarity to the (easily-computable) determinant, it is believed that...
AbstractLet Pnk be the maximum value achieved by the permanent over Λnk, the set of (0,1)-matrices o...
AbstractIt is shown that the permanent function of (0, 1)-matrices is a complete problem for the cla...
AbstractWe obtain convenient expressions and/or efficient algorithms for the permanent of certain ve...
By calculating the permanents for all Hadamard matrices of orders up to and including 28 we answer a...
In this paper we address the problem of computing the permanent of (0,1)-circulant matrices. We inve...
AbstractA recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, st...
Abstract. A new approximation algorithm for the permanent of an n × n 0,1-matrix is presented. The a...
AbstractIn this paper we address the problem of computing the permanent of (0,1)-circulant matrices....
AbstractWe show that the permanent of an n×n matrix with iid Bernoulli entries ±1 is of magnitude n(...
Let A be a square matrix over an arbitrary field. The permanent of the matrix A is defined as the al...
AbstractLet U(n, τ) be the set of all matrices of 0′s and 1′s of order n with exactly τ 0′s. We obta...
DOI
Add to ORKG