activity
20162023
most citedSelf-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower bounds

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

collaborators
Showing 2017 · cs.CCShow all

1 paper · 2 filters

cs.CC2017

Relating counting complexity to non-uniform probability measures

Eleni Bakali

A standard method for designing randomized algorithms to approximately count the number of solutions of a problem in P, is by constructing a rapidly mixing Markov chain converg…