Entry Dietzfelbinger:1991:CMT 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{Dietzfelbinger:1991:CMT,
  author =       "M. Dietzfelbinger and W. Maass and G. Schnitger",
  title =        "The complexity of matrix transposition on one-tape
                 off-line {Turing} machines",
  journal =      j-THEOR-COMP-SCI,
  volume =       "82",
  number =       "1",
  pages =        "113--129",
  day =          "22",
  month =        may,
  year =         "1991",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4140 (Linear algebra); C4220 (Automata theory);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Fachbereich Math./Inf., Univ. GH-Paderborn, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bit length; Boolean matrices; complexity;
                 computational complexity; lower bound argument; matrix
                 algebra; matrix transposition; nonlinear lower bound;
                 one-tape off-line Turing machines; optimal lower bound;
                 sorting; Turing machines; two-way input tape; upper
                 bound; worktape",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries