3 citations · 3 across the 8 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2014
Decision versions of optimization problems: cardinality constraint (lower bound) as a CNF Horn formula for Maximum Matching
Prabhu Manyem
We provide a formula for the lower bound in the form of , in such a way that the decision version of unweighted non-bipartite matching can be solved in polynomial time.…
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…