Entry Fortnow:1993:IPS 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{Fortnow:1993:IPS,
  author =       "Lance Fortnow and Carsten Lund",
  title =        "Interactive proof systems and alternating time-space
                 complexity",
  journal =      j-THEOR-COMP-SCI,
  volume =       "113",
  number =       "1",
  pages =        "55--73",
  day =          "24",
  month =        may,
  year =         "1993",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:17:13 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=113&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=113&issue=1&aid=1275",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Chicago Univ., IL, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "1-tape alternating Turing machine; alternating
                 time-space complexity; computational complexity;
                 exponential-time languages; k-tape alternating Turing
                 machine; polynomial-related time-space complexity;
                 public-coin interactive proof system; rough
                 equivalence; theorem proving; Turing machines;
                 verifier",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries