Prabhu Manyem
发表
Prabhu Manyem,
2008,
Chic. J. Theor. Comput. Sci..
Existential Second Order Logic Expression With Horn First Order for Maximum Clique (Decision Version)
pdf
Prabhu Manyem,
2010,
ArXiv.
James Harland,
Prabhu Manyem,
2008,
CATS.
Decision versions of optimization problems: cardinality constraint (lower bound) as a CNF Horn formula for Matching and Clique
pdf
Prabhu Manyem,
2014,
ArXiv.
Prabhu Manyem,
2011,
ArXiv.
Prabhu Manyem,
2014
.
Jerzy A. Filar,
Prabhu Manyem,
Kevin White,
2007
.
Expressibility at the machine level versus structure level: ESO universal Horn Logic and the class P
Prabhu Manyem,
2011
.
Julien Ugon,
Prabhu Manyem,
J. Ugon,
2012,
Electron. Colloquium Comput. Complex..
Prabhu Manyem,
Orestes Bueno,
2008,
Fundam. Informaticae.
Jerzy A. Filar,
Prabhu Manyem,
Kevin White,
2001,
Ann. Oper. Res..
Lower Bounds on Syntactic Logic Expressions for Optimization Problems and Duality using Lagrangean Dual to characterize optimality conditions
pdf
Prabhu Manyem,
2009,
ArXiv.
Clique and Vertex Cover are solvable in polynomial time if the input structure is ordered and contains a successor predicate
pdf
Prabhu Manyem,
2009,
ArXiv.
Luke Finlay,
Prabhu Manyem,
2005,
RAIRO Oper. Res..
Syntactic Characterisations of Polynomial-Time Optimisation Classes (Syntactic Characterizations of Polynomial-Time Optimization Classes)
pdf
Prabhu Manyem,
2006,
ArXiv.
Jerzy A. Filar,
Prabhu Manyem,
Kevin White,
2003
.
Prabhu Manyem,
2018,
Discret. Appl. Math..
Prabhu Manyem,
Marc Simon Visser,
Rhonda L. Salt,
2003,
J. Autom. Lang. Comb..
Prabhu Manyem,
2021
.
Prabhu Manyem,
2009
.
Prabhu Manyem,
Matthias F. M. Stallmann,
2010
.
Prabhu Manyem,
2006
.
Prabhu Manyem,
P. Manyem,
2013
.
Prabhu Manyem,
2002
.
Matthias F. Stallmann,
Prabhu Manyem,
Matthias F. M. Stallmann,
1996
.