\relax 
\bibstyle{siam}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}}
\@writefile{toc}{\contentsline {section}{\numberline {2}Overview}{1}}
\@writefile{toc}{\contentsline {section}{\numberline {3} The Restriction Method}{2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Decision Trees}{2}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces  Decision tree for function $f$.}}{3}}
\newlabel{fig:dt}{{1}{3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Lower Bound for Parity}{3}}
\@writefile{toc}{\contentsline {section}{\numberline {4}Switching Lemma}{5}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces  Canonical decision tree for $f\tmspace  -\thinmuskip {.1667em}\tmspace  -\thinmuskip {.1667em}\upharpoonright _\rho = x_5x_7 \vee x_4 \vee x_6x_5$.}}{6}}
\newlabel{fig:scdt}{{2}{6}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces  Canonical decision tree $T(f\tmspace  -\thinmuskip {.1667em}\tmspace  -\thinmuskip {.1667em}\upharpoonright _\rho )$}}{8}}
\newlabel{fig:cdt}{{3}{8}}
\@writefile{toc}{\contentsline {section}{\numberline {5}Lower bound for $AC_0$-Frege proofs of $PHP_n^{n+1}$.}{9}}