Satisfiability algorithms and lower bounds for boolean formulas

Lecture Series / Conference / Course : 
Indo UK workshop on Computational Complexity Theory
Subject: 
TCS
Speaker: 
Ruiwen Chen
Youtube-url: 
https://youtu.be/KRvxAqXkHeM
Date: 
Thursday, January 8, 2015