activity
20072020
most citedOptimal Aggregation of Blocks into Subproblems in Linear-Programs with Block-Diagonal-Structure

2 citations · 5 across the 12 of their papers we have counts for

collaborators
Showing 2007Show all

1 paper · 1 filter

cs.CC2007

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…