Entry Meer:1994:CQP from tcs1990.bib

Last update: Wed Sep 26 02:11:46 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | 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{Meer:1994:CQP,
  author =       "K. Meer",
  title =        "On the complexity of quadratic programming in real
                 number models of computation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "133",
  number =       "1",
  pages =        "85--94",
  day =          "11",
  month =        oct,
  year =         "1994",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:27 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=133&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=133&issue=1&aid=1711",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4240 (Programming
                 and algorithm theory)",
  conflocation = "Barcelona, Spain; 4-6 Oct. 1993",
  conftitle =    "Workshop on Continuous Algorithms and Complexity",
  corpsource =   "Lehrstuhl C f{\"u}r Math., Tech. Hochschule Aachen,
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity; computational complexity; NP-complete;
                 quadratic programming; real number models of
                 computation; weak BSS-model",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries