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.
The <strong>Complexity</strong> of SUB-MEM<br />
So SUB-MEM ∈ TIME(N 2 ), or maybe TIME(N 4+ɛ ), or surely in<br />
TIME(N 55 ), <strong>and</strong> so we get the “obvious” upper bound:<br />
SUB-MEM ∈ P.<br />
Next questions:<br />
Ross Willard (Waterloo) <strong>Algebra</strong> <strong>and</strong> <strong>Complexity</strong> Třešť, September 2008 9 / 31