activity
20192026
most citedPerfect Matching in Random Graphs is as Hard as Tseitin

1 citations · 2 across the 9 of their papers we have counts for

collaborators
Showing 2019 · cs.GTShow all

Nothing from them under that filter.

Their other years and fields are still on the left.