3 citations · 5 across the 7 of their papers we have counts for
1 paper · 1 filter
Leszek Aleksander Kołodziejczyk, Neil Thapen
We study a new class of NP search problems, those which can be proved total using standard combinatorial reasoning based on approximate counting. Our model for this kind of reasoni…