Mathematics – Optimization and Control
Scientist
Mathematics
Optimization and Control
Scientist
Clique and Vertex Cover are solvable in polynomial time if the input structure is ordered and contains a successor predicate
Duality Gap, Computational Complexity and NP Completeness: A Survey
ESO universal Horn and LFP logics: separation between machine level and structure level
Existential Second Order Logic Expression With Horn First Order for Maximum Clique (Decision Version)
Lower Bounds on Syntactic Logic Expressions for Optimization Problems and Duality using Lagrangian Dual to characterize optimality conditions
No associations
LandOfFree
Prabhu Manyem does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Prabhu Manyem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Prabhu Manyem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-52223