collaborators

1 paper

cs.DS2016

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

Tzvi Alon

In this thesis we develop FPTASs for the counting problems of m-tuples, contingency tables with two rows, and 0/1 knapsack. For the problem of counting m-tuples, we design two algo…