Entry Ablayev:1996:LBO 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{Ablayev:1996:LBO,
  author =       "Farid Ablayev",
  title =        "Lower bounds for one-way probabilistic communication
                 complexity and their application to space complexity",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "2",
  pages =        "139--159",
  day =          "05",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:53 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&issue=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=1996&volume=157&issue=2&aid=2098",
  acknowledgement = ack-nhfb,
  classification = "B6150M (Protocols); C4210 (Formal logic); C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory); C5640 (Protocols)",
  corpsource =   "Dept. of Theor. Cybern., Kazan Univ., Russia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Boolean functions; boolean functions; communication
                 complexity; computational complexity; lower bounds;
                 one-way probabilistic communication complexity;
                 probabilistic communication protocols; protocols; space
                 complexity",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries