1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2017
Some facts on Permanents in Finite Characteristics
Anna Knezevic, Greg Cohen, Marina Domanskaya
The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrice…
cs.DM2010★ 1 cited
A new algebraic technique for polynomial-time computing the number modulo 2 of Hamiltonian decompositions and similar partitions of a graph's edge set
Greg Cohen
In Graph Theory a number of results were devoted to studying the computational complexity of the number modulo 2 of a graph's edge set decompositions of various kinds, first of all…