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

1 paper · 1 filter

cs.CC2020

Characterizations and approximability of hard counting classes below #P

Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis

An important objective of research in counting complexity is to understand which counting problems are approximable. In this quest, the complexity class TotP, a hard subclass of #P…