| No. | Title | Author | Year |
|---|---|---|---|
| 1 | A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy | Halman, Nir | 2016 |
| 2 | Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games are all LP-Type Problems | Halman, Nir | 2008 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 2 |