activity
20242026
most citedA Piecewise Approach for the Analysis of Exact Algorithms

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

collaborators
Showing 2026Show all

1 paper · 1 filter

cs.DS2026

Faster Exponential-Time Approximate Counting via Bounded Self-Reductions

Katie Clinch, Serge Gaspers, Simon Mackenzie +1

We give faster exponential-time randomised approximation algorithms for counting problems where polynomial-time approximation is unavailable and exact exponential-time counting rem…