Buscar
Mostrando ítems 1-2 de 2
Artículo
On permanents of Sylvester Hadamard matrices
(Cornell University, 2013)
It is well-known that the evaluation of the permanent of an arbitrary (−1, 1)- matrix is a formidable problem. Ryser’s formula is one of the fastest known general algorithms for computing permanents. In this paper, Ryser’s ...
Artículo
The maximal determinant of cocyclic (−1, 1)-matrices over D2t
(Elsevier, 2012)
Cocyclic construction has been successfully used for Hadamard matrices of order n. These -matrices satisfy that and give the solution to the maximal determinant problem when or a multiple of 4. In this paper, we approach ...