activity
20062022
most citedDuality Gap, Computational Complexity and NP Completeness: A Survey

3 citations · 3 across the 8 of their papers we have counts for

collaborators
Showing 2009 · cs.LOShow all

1 paper · 2 filters

cs.LO2009

Lower Bounds on Syntactic Logic Expressions for Optimization Problems and Duality using Lagrangian Dual to characterize optimality conditions

Prabhu Manyem

We show that simple syntactic expressions such as existential second order (ESO) universal Horn formulae can express NP-hard optimisation problems. There is a significant differenc…