3 papers
cs.CG2020
Lower bounds for the maximum number of runners that cause loneliness, and its application to Isolation
Deepak Ponvel Chermakani
We consider (n+1) runners with given constant unique integer speeds running along the circumference of a circle whose circumferential length is one, and all runners starting from t…
cs.CC2012
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…
cs.CC2012
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…