Formal
Languages
and the
Theory of
Computation

Fall 2016
course
navigation

end of term topics

Time (chap 7 in text) Space (chap 8 in text) complexity zoo (see link on resources page; particularly "gentle" ones) probabilistic algorithms (10.2) interactive proofs i.e. Arthur/Merlin i.e. zero-knowledge (10.4) crypto (10.6 + other sources) quantum computing (other sources)
http://cs.marlboro.edu/ courses/ fall2016/formal_languages/ notes/ end_of_term_topics
last modified Tuesday November 15 2016 12:44 pm EST