Entry Boyar:1992:AMC 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{Boyar:1992:AMC,
  author =       "J. Boyar and G. Frandsen and C. Sturtivant",
  title =        "An arithmetic model of computation equivalent to
                 threshold circuits",
  journal =      j-THEOR-COMP-SCI,
  volume =       "93",
  number =       "2",
  pages =        "303--319",
  day =          "17",
  month =        feb,
  year =         "1992",
  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 = "B0210 (Algebra); B1265B (Logic circuits); C4210
                 (Formal logic); C4240 (Programming and algorithm
                 theory); C5120 (Logic and switching circuits)",
  corpsource =   "Chicago Univ., IL, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic laws; arbitrary weights; arithmetic circuit
                 depth; arithmetic model; Boolean computations; Boolean
                 functions; Boolean threshold computations;
                 characteristic-two finite fields; circuit size;
                 computational complexity; fan-in arithmetic gates;
                 logic circuits; threshold circuit depth; threshold
                 functions; threshold logic",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries