By Valentine Kabanets, explicitly credited on PDF p. 1. Authored lecture notes within CMPT 710 and CMPT 407 - Computational Complexity - Fall 2007, dated 8 November 2007. Simon Fraser University hosts the notes; the instructor credit is separate from the lecture byline.
Cited passages: §3.1, printed pp. 3–4, Lemma 4, hypotheses and inductive proof; §3.2, printed p. 4, formula equality, one-sided error and degree/bit-cost discussion.

Ancestors (4)

  1. CMPT 710 and CMPT 407 - Computational Complexity - Fall 2007
  2. Computer science bibliography
  3. Computer science
  4. Home

Incoming links (1)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version