3 citations · 5 across the 7 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
math.LO2018★ 1 cited
Approximate counting and NP search problems
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…
math.LO2014★ 3 cited
How much randomness is needed for statistics?
Bjørn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen
In algorithmic randomness, when one wants to define a randomness notion with respect to some non-computable measure , a choice needs to be made. One approach is to allow randomn…