Permanent mod $2$ of biadjacency gives polynomial time algorithm of $\#PM(G)\mod 2$ of perfect matchings of bipartite graph. Is there a similar efficient strategy for general graphs?
Mod $2$ of $\#PM(G)$ for arbitrary G?
Turbo
- 13.9k
- 1
- 27
- 76