Login / Signup
Self-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower bounds.
Eleni Bakali
Published in:
CoRR (2016)
Keyphrases
</>
average case complexity
decision problems
lower bound
worst case
upper bound
computational complexity
query processing
np hard