Index of Lectures

<ul>
<li>
	Lecture 1: (Jan 20)
		<a href=l1.ps>Introduction to Complexity Theory</a>
		Please pick up the corresponding notes,
		<a href=../hw/c1.ps>chapter 1</a>.

<li>
	Lecture 2: (Jan 25)
		<a href=l2.ps>The Turing Model</a>
		Please pick up the corresponding notes,
		<a href=../hw/c2.ps>chapter 2</a>.
		
<li>
	Lecture 3: (Jan 27)
		<a href=l3.ps>The Basic Results</a>
		
<li>
	Lecture 4: (Feb 1)
		<a href=l4.ps>Complement of Space Classes</a>
		
<li>
	Lecture 5: (Feb 3)
		<a href=l5.ps>Register Machines</a>

<li>
	Lecture 6: (Feb 8)
		<a href=l6.ps>Reducibilities</a>

<li>
	Lecture 7: (Feb 10)
		<a href=l7.ps>Ladner's Theorem</a>

<li>
	Lecture 8: (Feb 24)
		<a href=l8.ps>Complete Languages</a>
<li>
	Lecture 9: (Mar 1)
		<a href=l9.ps>Complete Languages (concluded)</a>
<li>
	Lecture 10: (Mar 3)
		<a href=l10.ps>Separation Results</a>

<li>
	Lecture 11: (Mar 8)
		<a href=l11.ps>Computating with Choices</a>

<li>
	Lecture 12: (Mar 10)
		<a href=l12.ps>Computating with Choices</a>
<li>
	Lecture 13: (Mar 22)
		<a href=l13.ps>Alternating Choices</a>
<li>
	Lecture 14: (Mar 24)
		<a href=l14.ps>Stochastic Choices</a>

<li>
	Lecture 15: (Mar 29, 31)
		<a href=l14.ps>Interactive Proofs (Graph Nonisomorphism)</a>
</ul>