This is how I normally calculate the determinant of a matrix.
However, the complexity of this algorithm is O(n!).
How to calculate it in polynomial time?
P.S: Why I need to calculate the determinant of a matrix in polynomial time?
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
This is how I normally calculate the determinant of a matrix.
However, the complexity of this algorithm is O(n!).
How to calculate it in polynomial time?
P.S: Why I need to calculate the determinant of a matrix in polynomial time?
Name |
---|
Your second link is one click away from an efficient algorithm, which is Gaussian elimination. See the bottom of determinant's properties.
Gaussian elimination.
Please keep in mind that Gaussian is numerically unstable in general case. It is not a problem in Laplacian matrix, as it is diagonally dominant.