Entry Arvind:1995:INP 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{Arvind:1995:INP,
  author =       "Vikraman Arvind and Johannes K{\"o}bler and Uwe
                 Sch{\"o}ning and Rainer Schuler",
  title =        "If {NP} has polynomial-size circuits, then {MA$=$AM}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "137",
  number =       "2",
  pages =        "279--282",
  day =          "23",
  month =        jan,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:46 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&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=1995&volume=137&issue=2&aid=1783",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity)",
  corpsource =   "Dept. of Comput. Sci., Inst. of Math. Sci., Madras,
                 India",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Arthur--Merlin hierarchy; computational complexity;
                 polynomial-size circuits; polynomial-time hierarchy",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries