Madhukar N. Thakur
Online
DBLP
entries are available for
Madhukar N. Thakur
and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)
Phokion G. Kolaitis
,
David L. Martin
, Madhukar N. Thakur: On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates.
PODS 1998
: 197-204
Ian Barland
,
Phokion G. Kolaitis
, Madhukar N. Thakur: Integer Programming as a Framework for Optimization and Approximability.
JCSS 57
(2): 144-161 (1998)
Phokion G. Kolaitis
, Madhukar N. Thakur: Approximation Properties of NP Minimization Classes.
JCSS 50
(3): 391-411 (1995)
Sanjeev Saluja
,
K. V. Subrahmanyam
, Madhukar N. Thakur: Descriptive Complexity of #P Functions.
JCSS 50
(3): 493-505 (1995)
Phokion G. Kolaitis
, Madhukar N. Thakur: Logical Definability of NP Optimization Problems.
Information and Computation 115
(2): 321-353 (1994)
DBLP: Copyright ©1999 by Michael Ley (
ley@uni-trier.de
).
