Entry Middendorf:1993:SCN 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{Middendorf:1993:SCN,
  author =       "M. Middendorf",
  title =        "The shortest common nonsubsequence problem is
                 {NP-complete}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "108",
  number =       "2",
  pages =        "365--369",
  day =          "15",
  month =        feb,
  year =         "1993",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:16:58 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=108&issue=2;
                 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=1993&volume=108&issue=2&aid=1232",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  corpsource =   "Inst. fur Angewandte Inf. und Formale Sprachen,
                 Karlsruhe, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "alphabet; computational complexity; finite set; formal
                 languages; NP-complete; set theory; shortest common
                 nonsubsequence problem",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries