2 citations · 5 across the 12 of their papers we have counts for
5 papers · 1 filter
NP-Hardness of optimizing the sum of Rational Linear Functions over an Asymptotic-Linear-Program
Deepak Ponvel Chermakani
We convert, within polynomial-time and sequential processing, an NP-Complete Problem into a real-variable problem of minimizing a sum of Rational Linear Functions constrained by an…
NP-Completeness of deciding the feasibility of Linear Equations over binary-variables with coefficients and constants that are 0, 1, or -1
Deepak Ponvel Chermakani
We convert, within polynomial-time and sequential processing, NP-Complete Problems into a problem of deciding feasibility of a given system S of linear equations with constants and…
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…
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…
Expressing Reachability in Linear Recurrences, as Infinite Determinants and Rational Polynomial Equations
Deepak Ponvel Chermakani
We present two tools, which could be useful in determining whether or not a non-Homogenous Linear Recurrence can reach a desired rational. First, we derive the determinant that is…