Deepak Ponvel Chermakani

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2012
i8		Deepak Ponvel Chermakani: Expressing Reachability in Linear Recurrences, as Infinite Determinants and Rational Polynomial Equations. CoRR abs/1201.0572 (2012)
i7		Deepak Ponvel Chermakani: A Non-Triviality Certificate for Scalars and its application to Linear Systems. CoRR abs/1204.1764 (2012)
i6		Deepak Ponvel Chermakani: Efficiently expressing feasibility problems in Linear Systems, as feasibility problems in Asymptotic-Linear-Programs. CoRR abs/1206.4236 (2012)
i5		Deepak Ponvel Chermakani: NP-Completeness of deciding the . CoRR abs/1210.4120 (2012)
i4		Deepak Ponvel Chermakani: NP-Hardness of optimizing the sum of Rational Linear Functions over an Asymptotic-Linear-Program. CoRR abs/1212.5097 (2012)
	2010
i3		Deepak Ponvel Chermakani: A new Rational Generating Function for the Frobenius Coin Problem. CoRR abs/1001.0415 (2010)
i2		Deepak Ponvel Chermakani: Repeating Patterns in Linear Programs that express NP-Complete Problems. CoRR abs/1003.1164 (2010)
	2008
i1		Deepak Ponvel Chermakani: Deciding Solvability of a Univariate Polynomial Equation with Integer Coefficients. CoRR abs/0803.0018 (2008)

Last update Thu May 23 04:39:22 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page