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 2018Show all

2 papers · 1 filter

cs.DM2018

Exact uniform sampling over catalan structures

Alexandros Angelopoulos, Eleni Bakali

We present a new framework for creating elegant algorithms for exact uniform sampling of important Catalan structures, such as triangulations of convex polygons, Dyck words, monoto…

cs.CC2018

On randomized counting versus randomised decision

Eleni Bakali

We study the question of which counting problems admit f.p.r.a.s., under a structural complexity perspective. Since problems in #P with NP-complete decision version do not admit f.…