Entry Beigel:1992:CCT 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{Beigel:1992:CCT,
  author =       "R. Beigel and J. Gill",
  title =        "Counting classes: thresholds, parity, mods, and
                 fewness",
  journal =      j-THEOR-COMP-SCI,
  volume =       "103",
  number =       "1",
  pages =        "3--23",
  day =          "24",
  month =        aug,
  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 = "C4220 (Automata theory); C4240 (Programming and
                 algorithm theory)",
  conflocation = "Rouen, France; 22-24 Feb. 1990",
  conftitle =    "STACS 90. 7th Annual Symposium on Theoretical Aspects
                 of Computer Science",
  corpsource =   "Dept. of Comput. Sci., Yale Univ., New Haven, CT,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "accepting computations; closure properties; complexity
                 theory; computational complexity; counting classes;
                 fewness; mods; nondeterministic polynomial-time Turing
                 machines; NP machine; parity; thresholds; Turing
                 machines",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries