2 citations · 5 across the 12 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.CC2010
Repeating Patterns in Linear Programs that express NP-Complete Problems
Deepak Ponvel Chermakani
One of my recent papers transforms an NP-Complete problem into the question of whether or not a feasible real solution exists to some Linear Program. The unique feature of this Lin…
cs.DM2010★ 1 cited
A new Rational Generating Function for the Frobenius Coin Problem
Deepak Ponvel Chermakani
An important question arising from the Frobenius Coin Problem is to decide whether or not a given monetary sum S can be obtained from N coin denominations. We develop a new Generat…