SAT Solving and Complexity Theory
Possible topics include: a recollection of notions in complexity theory, the state of the art for P vs NP, and how SAT solving could help prove great theorems in complexity theory
Ryan Williams, IBM Almaden Research Center, San Jose, USA
Josef Raviv Fellow at IBM since September 2009