1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.CC2012
Efficiently expressing feasibility problems in Linear Systems, as feasibility problems in Asymptotic-Linear-Programs
Deepak Ponvel Chermakani
We present a polynomial-time algorithm that obtains a set of Asymptotic Linear Programs (ALPs) from a given linear system S, such that one of these ALPs admits a feasible solution…
cs.CC2012★ 1 cited
A Non-Triviality Certificate for Scalars and its application to Linear Systems
Deepak Ponvel Chermakani
We present an approach of taking a linear weighted Average of N given scalars, such that this Average is zero, if and only if, all N scalars are zero. The weights for the scalars i…
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…