Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Bajaj:1987:GOP,
author = "C. Bajaj",
title = "Geometric optimization and the polynomial hierarchy",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "1",
pages = "87--102",
month = sep,
year = "1987",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C4240 (Programming and
algorithm theory); C4290 (Other computer theory)",
conflocation = "New Delhi, India; 16-18 Dec. 1985",
conftitle = "Fifth Conference on Foundations of Software Technology
and Theoretical Computer Science",
corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Co-NP; computational complexity; computational
complexity classes; computational geometry; geometric
optimization; location-allocation problems under
minimax; location-allocation problems under minsum;
optimisation; polynomial hierarchy",
pubcountry = "Netherlands A05",
sponsororg = "Indian Inst. Technol.; Tata Inst. Fundamental Res",
treatment = "T Theoretical or Mathematical",
}