Errata found by CS 601 class, spring 2011, for
Computational Complexity A Modern Approach
by Arora and Barak.
|
- p 19, Figure 1.5:
- In the second two tapes, the "d" should be "p".
- p 22, Fig. 1.7:
- The second row should be labeled 1, not 0, and the entry in column 0
of row α should be Mα(0) not
Mα(α).
- p 25, l -3:
- < x,i > should be < x,y,i
>.
- p 26, Sec. 1.6.1, 4th paragraph:
- "computational model that" should
be "computational model than".
- p 30, 2nd paragraph:
- "0(Blank Symbol)01" should be "0(Blank Symbol)10".
- p 41, Claim 2.4, :
- Definition of EXP missing, should be
⋃c> 1 DTIME[2n^c].
- p 44, first equation:
- The existentially quantified u should not be a subscript of
the existential quantifier.
- p 47 4th paragraph:
- 0p(|x| should be 0p(|x|).
- p 54, 4th line from bottom of proof of Thm 2.17 :
- Figure 2.1 should be 2.6.
- p 60, footnote:
- "Not" should be "note".
- p 78 - 93:
- Throughout Chapter 4, space bounds are sometimes "S" and sometimes "s"
inconsistently, even when referring to the same function. It would be better to make them all "s".
- p 79, second full paragraph, 3rd sentence:
-
“since the work tape has length n” should be “since the input tape has length n”.
- p 93, l 2:
- "Hartnmanis" should be "Hartmanis".
- p 109, last line of boxed Note 6.4:
-
"y5y3 ∨ y4"
should be
"y5 = y3 ∨ y4".
Thanks to:
Daniel Barowy,
James Browning,
Peter Krafft,
for pointing out corrections.