Entry Mayer:1996:CPI 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{Mayer:1996:CPI,
  author =       "Alain J. Mayer and Larry J. Stockmeyer",
  title =        "The complexity of {PDL} with interleaving",
  journal =      j-THEOR-COMP-SCI,
  volume =       "161",
  number =       "1--2",
  pages =        "109--122",
  day =          "15",
  month =        jul,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:03 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-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=161&issue=1-2&aid=2036",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Columbia Univ., New York, NY,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity; computability; computational complexity;
                 concurrently executing programs; formal logic;
                 interleaving; parallel programming; PDL; propositional
                 dynamic logic; satisfiability problem",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries