Entry Handley:1997:DSM 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{Handley:1997:DSM,
  author =       "W. G. Handley",
  title =        "Deterministic summation modulo {$B_n$}, the semigroup
                 of binary relations on {$0, 1, \ldots{}, n-1$}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "172",
  number =       "1--2",
  pages =        "135--174",
  day =          "10",
  month =        feb,
  year =         "1997",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:35 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=172&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=1997&volume=172&issue=1-2&aid=2186",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory)",
  corpsource =   "BUCS, Bath Univ., UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Bel'tyukov's stack register machines; binary
                 relations; Boolean functions; boolean operations;
                 bounded first-order quantification; bounded product;
                 bounded quantification; bounded summation;
                 deterministic summation module; elementary functions;
                 monoid; permutations; semigroup; Turing machines",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries