8 citations · 9 across the 4 of their papers we have counts for
1 paper · 1 filter
Amol Pasarkar, Mihalis Yannakakis, Christos Papadimitriou
We study the complexity of computational problems arising from existence theorems in extremal combinatorics. For some of these problems, a solution is guaranteed to exist based on…