Entry Ambos-Spies:1989:RCH from tcs1985.bib

Last update: Thu Sep 27 02:46:57 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{Ambos-Spies:1989:RCH,
  author =       "Klaus Ambos-Spies",
  title =        "On the relative complexity of hard problems for
                 complexity classes without complete problems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "63",
  number =       "1",
  pages =        "43--61",
  month =        jan,
  year =         "1989",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Oldenburg",
  affiliationaddress = "Oldenburg, West Ger",
  classification = "723; 921; C4240 (Programming and algorithm theory)",
  corpsource =   "Fachbereich Inf., Oldenburg Univ., West Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  journalabr =   "Theor Comput Sci",
  keywords =     "complexity classes; computational complexity;
                 Computational Complexity; Computer Metatheory; hard
                 problems; Mathematical Techniques--Set Theory; natural
                 closure properties; np Completeness; Partial Ordering;
                 Polynomial Time Reducibility; polynomial time
                 reducibility notions; recursive sequence; Recursive
                 Sets; recursive sets; relative complexity",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries