This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 1 2 (log n) (log n) . 2 n 1,000,000 . 3 n 7 4 2 n 5 (log n) 5 . 3) (S11) How is automata theory similar to complexity theory? 4) (S11) How are they different? Take home review questions 1) How do we define how hard a problem is to solve? 2) Generally speaking, a problem is easy to solve if it belongs to Poly. What does it mean to be long to Poly? 3) True or false and explain your answer. Automata theory is different from complexity theory in that Automata theory focuses on the unsolvable problems....
View
Full
Document
This note was uploaded on 07/25/2008 for the course CSE 460 taught by Professor Torng during the Fall '07 term at Michigan State University.
 Fall '07
 TORNG

Click to edit the document details