Search
	A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy Halman N. Theoretical Computer Science645(C):41-47,2016.Type:Article     Published By: Elsevier Science Publishers Ltd.       Use your personal or institutional subscription to read the fulltext of the article.               You can purchase an article without having a subscription.
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy