3 citations · 3 across the 8 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
math.OC2010★ 3 cited
Duality Gap, Computational Complexity and NP Completeness: A Survey
Prabhu Manyem
We survey research that studies the connection between the computational complexity of optimization problems on the one hand, and the duality gap between the primal and dual optimi…
cs.CC2010
Existential Second Order Logic Expression With Horn First Order for Maximum Clique (Decision Version)
Prabhu Manyem
We show that the maximum clique problem (decision version) can be expressed in existential second order (ESO) logic, where the first order part is a Horn formula in second-order qu…