Fully polynomial time approximation schemes (FPTAS) for some counting problems.

Published in: CoRR (2016)

Keyphrases

approximation schemes
approximation algorithms
np hardness
special case
np complete
np hard
worst case
image processing
reinforcement learning
computational complexity