Entry Avenhaus:1984:NRP from tcs1980.bib

Last update: Thu Sep 27 02:46:46 MDT 2018                Valid HTML 4.0!

Index sections

Top | 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{Avenhaus:1984:NRP,
  author =       "J. Avenhaus and K. Madlener",
  title =        "The {Nielsen} reduction and {P}-complete problems in
                 free groups",
  journal =      j-THEOR-COMP-SCI,
  volume =       "32",
  number =       "1--2",
  pages =        "61--76",
  month =        jul,
  year =         "1984",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C1110 (Algebra); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Fachbereich Inf., Univ. Kaiserslautern,
                 Kaiserslautern, West Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "classical algorithmic problems; computation encoding;
                 computational complexity; deterministic polynomially
                 time bounded TM; equal subgroups; free groups;
                 generalised word problem; group theory; independent
                 generator set; isomorphic subgroups; log-space
                 reducibility; Nielsen reduction; P-complete problems;
                 polynomial time; shortest coset representatives",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries