Entry Wegener:1985:CSF from tcs1985.bib

Last update: Thu Sep 27 02:46:57 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{Wegener:1985:CSF,
  author =       "I. Wegener",
  title =        "On the complexity of slice functions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "38",
  number =       "1",
  pages =        "55--68",
  month =        may,
  year =         "1985",
  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/tcs1985.bib",
  acknowledgement = ack-nhfb,
  classification = "B1265B (Logic circuits); C1160 (Combinatorial
                 mathematics); C4210 (Formal logic); C4230B
                 (Combinatorial switching theory)C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Johann Wolfgang Goethe-Univ., Frankfurt, West
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "arbitrary complete bases; Boolean convolution; Boolean
                 functions; canonical slice functions; circuit
                 combination complexity; clique function; combinatorial
                 circuits; combinatorial switching; computational
                 complexity; conjunction; disjunction; monotone circuit
                 complexity; Nechiporuk Boolean sums; set circuits; set
                 intersection; set theory; set union",
  pubcountry =   "Netherlands A04",
  treatment =    "T Theoretical or Mathematical",
}

Related entries