Entry Arvind:2002:QCP from chicjtheorcomputsci.bib

Last update: Sun Jul 23 02:00:24 MDT 2017                Valid HTML 3.2!

Index sections

Top | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | Y | Z

BibTeX entry

@Article{Arvind:2002:QCP,
  author =       "V. Arvind and K. V. Subrahmanyam and N. V.
                 Vinodchandran",
  title =        "The Query Complexity of Program Checking by
                 Constant-Depth Circuits",
  journal =      j-CHIC-J-THEOR-COMPUT-SCI,
  day =          "5",
  month =        dec,
  year =         "2002",
  ISSN =         "1073-0486",
  bibdate =      "Fri Jan 09 16:45:42 2004",
  bibsource =    "http://cjtcs.cs.uchicago.edu/;
                 http://www.math.utah.edu/pub/tex/bib/chicjtheorcomputsci.bib",
  URL =          "http://cjtcs.cs.uchicago.edu/articles/2002/2/contents.html",
  acknowledgement = ack-nhfb,
}

Related entries