A Novel Algorithm for Permanent Computation

OpenAlex İngilizce

This study computes the permanent of a square matrix by reducing it to triangular form. To achieve the triangularization of a matrix, this paper employs additive row operations. Although applying an additive row operation does not alter the determinant, it does affect the permanent, thereby increasing the complexity of the computational process. This difficulty has discouraged previous attempts to compute the permanent via triangularization. This paper addresses this challenge and introduces a novel approach for computing the permanent of a square matrix.