Universal Algebra and Computational Complexity Lecture 3
Universal Algebra and Computational Complexity Lecture 3
Universal Algebra and Computational Complexity Lecture 3
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Summary of <strong>Lecture</strong> 2<br />
Recall from Tuesday:<br />
L ⊆ NL ⊆ P ⊆ NP ⊆ PSPACE ⊆ EXPTIME · · ·<br />
∈<br />
∈<br />
∈<br />
∈<br />
∈<br />
∈<br />
FVAL,<br />
2COL<br />
PATH,<br />
2SAT<br />
CVAL,<br />
HORN-<br />
3SAT<br />
SAT ,<br />
3SAT ,<br />
3COL,<br />
4COL, etc.<br />
HAMPATH<br />
1-CLO<br />
CLO<br />
Ross Willard (Waterloo) <strong>Algebra</strong> <strong>and</strong> <strong>Complexity</strong> Třešť, September 2008 2 / 31
Change language