Timeline for Matrix permanent is 0
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 26, 2015 at 19:29 | comment | added | Charles | This is an interesting answer to a question I didn't ask, +1. | |
| Oct 26, 2015 at 18:24 | comment | added | Emil Jeřábek | @SashoNikolov: Notice that the answer starts with If. (That is, it is answering a different question.) | |
| Oct 26, 2015 at 18:03 | comment | added | Sasho Nikolov | Why does it suffice to know the parity? What if the permanent is even? After all this is equivalent to deciding if a bipartite graph has a perfect matching. The closest algorithm I know to what you are suggesting is Lovasz's idea of introducing formal variables for each matrix entry and deciding if the determinant is identically zero as a polynomial. | |
| Oct 26, 2015 at 17:59 | history | answered | Rasmus Pagh | CC BY-SA 3.0 |