Writing the permanent of a matrix in terms of determinant

Abstract

We analyze the challenge of representing determinants of (potentially bigger) matrices as permanents. Computing permanent and determinant complexities generally correlate to mathematical versions of the classes NP and P, respectively. We discuss some recently discovered techniques that might lead to a demonstration of the claim that permanent can only be stated as the determinant of exponential-sized matrices.