Entry Cucker:1996:GKP from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                Valid HTML 3.2!

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{Cucker:1996:GKP,
  author =       "Felipe Cucker and Michael Shub",
  title =        "Generalized {Knapsack} problems and fixed degree
                 separations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "161",
  number =       "1--2",
  pages =        "301--306",
  day =          "15",
  month =        jul,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=161&issue=1-2&aid=2205",
  acknowledgement = ack-nhfb,
  classification = "C1290 (Applications of systems theory); C4220
                 (Automata theory); C4240C (Computational complexity)",
  corpsource =   "Univ. Pompeu Fabra, Barcelona, Spain",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Boolean setting; complexity classes; computational
                 complexity; deterministic time; fixed degree
                 separations; fixed-degree polynomial time bounds;
                 generalized knapsack problems; nondeterministic time;
                 operations research; strict inclusion; Turing
                 machines",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries