APA (7th ed.) Citation

Halman, N. (2016). A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy. Theoretical computer science, 645, 41-47. https://doi.org/10.1016/j.tcs.2016.06.015

Chicago Style (17th ed.) Citation

Halman, Nir. "A Deterministic Fully Polynomial Time Approximation Scheme for Counting Integer Knapsack Solutions Made Easy." Theoretical Computer Science 645 (2016): 41-47. https://doi.org/10.1016/j.tcs.2016.06.015.

MLA (9th ed.) Citation

Halman, Nir. "A Deterministic Fully Polynomial Time Approximation Scheme for Counting Integer Knapsack Solutions Made Easy." Theoretical Computer Science, vol. 645, 2016, pp. 41-47, https://doi.org/10.1016/j.tcs.2016.06.015.