Some facts on Permanents in Finite Characteristics
share
In the present article we essentially extend the result for the permanent over fields of characteristic 3 stating that the computation of the permanent of a k-semi-unitary matrix, i.e. a square matrix such that the difference between it and the identity matrix is of rank k, is #_3-P-complete if k > 1 and can be performed in a polynomial time otherwise to reviewing the properties of the permanent of a square matrix in an arbitrary prime characteristic and a number of identities relating the permanents of its submatrices and some matrices we can, provided a number of conditions are fulfilled, recieve via certain polynomial-time reductions.
READ FULL TEXT