551 citations · 927 across the 11 of their papers we have counts for
1 paper · 2 filters
Kamil Brádler, Pierre-Luc Dallaire-Demers, Patrick Rebentrost +2
A famously hard graph problem with a broad range of applications is computing the number of perfect matchings, that is the number of unique and complete pairings of the vertices of…