Entry Karpinski:1996:RVD 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{Karpinski:1996:RVD,
  author =       "Marek Karpinski and Rutger Verbeek",
  title =        "On randomized versus deterministic computation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "1",
  pages =        "23--39",
  day =          "22",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:40 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&issue=1;
                 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=1996&volume=154&issue=1&aid=2068",
  acknowledgement = ack-nhfb,
  classification = "C1140G (Monte Carlo methods); C4220 (Automata
                 theory); C4240C (Computational complexity)",
  conflocation = "Lund, Sweden; 5-9 July 1993",
  conftitle =    "ICALP 93. 20th International Colloquium on Automata,
                 Languages and Programming",
  corpsource =   "Dept. of Comput. Sci., Bonn Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; decidability; deterministic
                 algorithms; deterministic automata; deterministic
                 computation; deterministic time classes; exponential
                 deterministic time; Las Vegas algorithms; linear
                 randomized time; Monte Carlo methods; Monte Carlo
                 polynomial time; oracle; polynomial randomized time;
                 polynomial reduction; polynomial time hierarchy;
                 polynomial-size circuits; random coin tosses;
                 randomised algorithms; randomized computation;
                 randomized time classes; simulation; unfaithful
                 polynomial random reduction",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries