Entry Leggett:1981:OPP from tcs1980.bib

Last update: Thu Sep 27 02:46:46 MDT 2018                Valid HTML 4.0!

Index sections

Top | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Leggett:1981:OPP,
  author =       "E. W. {Leggett, Jr.} and D. J. Moore",
  title =        "Optimization problems and the polynomial hierarchy",
  journal =      j-THEOR-COMP-SCI,
  volume =       "15",
  number =       "3",
  pages =        "279--289",
  month =        sep,
  year =         "1981",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:36:07 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques)",
  corpsource =   "Clemson Univ., Clemson, SC, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Chromatic Number Problem; Knapsack Packing Problem;
                 Maximal Clique Problem; optimisation; optimisation
                 problems; polynomial hierarchy; Symmetric Traveling
                 Salesman Problem",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries