Live briefing
Everything about Computing the permanent
Problem in linear algebra
In linear algebra, the computation of the permanent of a matrix is a problem that is thought to be more difficult than the computation of the determinant of a matrix despite the apparent similarity of the definitions. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Computing the permanentA 5-minute orientation
- Skim a recent paper: Utilizing Soft Computing Techniques to Estimate the Axial Permanent Deformation of Asphalt ConcreteInfluential work since 2022
- Pick up a classic book: The Computer Privacy ReportThe most-reprinted book on the subject
- Read the landmark paper: The complexity of computing the permanentCited 1,770 times
- Go sideways: Adjugate matrixA closely related topic
- Go sideways: Permanent (mathematics)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
The complexity of computing the permanent
Computing the Permanent of (Some) Complex Matrices
Computing the field in permanent-magnet axial-field motors
Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
On the hardness of computing the permanent of random matrices
Unification of the Nature’s Complexities via a Matrix Permanent—Critical Phenomena, Fractals, Quantum Computing, ♯P-Complexity
Computing the permanent by importance sampling method
Experimental linear optical computing of the matrix permanent
🆕 Influential since 2022
📚 Books worth reading
The Computer Privacy ReportDr. WG Hill · 1996
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Adjugate matrix In linear algebra, the adjugate or classical adjoint adj(A) of a square matrix A is the transpose of its cofactor matrix. It is occasionally known as adjunct…
- Permanent (mathematics) In linear algebra, the permanent of a square matrix is a function of the matrix similar to the determinant. The permanent, as well as the determinant,…
- Hamiltonian cycle polynomial In mathematics, the Hamiltonian cycle polynomial of an n×n-matrix is a polynomial in its entries, defined as ham ( A ) = ∑ σ ∈ H n ∏ i = 1 n a i , σ…
- Determinant In mathematics, the determinant is a scalar-valued function of the entries of a square matrix that has many properties which make it fundamental for the…
- Pfaffian In mathematics, the determinant of an m-by-m skew-symmetric matrix can always be written as the square of a polynomial in the matrix entries, a polynomial…
- Eigenvalue algorithm In numerical analysis, one of the most important problems is designing efficient and stable algorithms for finding the eigenvalues of a matrix. These eigenvalue…
- Characteristic polynomial In linear algebra, the characteristic polynomial of a square matrix is a polynomial which is invariant under matrix similarity and has the eigenvalues…
- Kirchhoff's theorem In the mathematical field of graph theory, Kirchhoff's theorem or Kirchhoff's matrix tree theorem is a theorem about the number of spanning trees in a…