2 citations · 5 across the 12 of their papers we have counts for
12 papers
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…
Optimal Aggregation of Blocks into Subproblems in Linear-Programs with Block-Diagonal-Structure
Deepak Ponvel Chermakani
Wall-clock-time is minimized for a solution to a linear-program with block-diagonal-structure, by decomposing the linear-program into as many small-sized subproblems as possible, e…
Efficiently determining Convergence in Polynomial Recurrence Sequences
Deepak Ponvel Chermakani
We derive the necessary and sufficient condition, for a given Polynomial Recurrence Sequence to converge to a given target rational K. By converge, we mean that the Nth term of the…
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…
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…
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…
Another approach to decide on real root existence for univariate Polynomials, and a multivariate extension for 3-SAT
Deepak Ponvel Chermakani
We present six Theorems on the univariate real Polynomial, using which we develop a new algorithm for deciding the existence of atleast one real root for univariate integer Polynom…
Expressing an NP-Complete Problem as the Solvability of a Polynomial Equation
Deepak Chermakani
We demonstrate a polynomial approach to express the decision version of the directed Hamiltonian Cycle Problem (HCP), which is NP-Complete, as the Solvability of a Polynomial Equat…