| date | slides | |
|---|---|---|
| 2010-06-14 | Circuit Complexity and Multiplicative Complexity of Boolean Functions Franco-Russian workshop on Algorithms, complexity and applications |
|
| 2009-12-18 | On Formal Complexity Measures (in Russian) Steklov Mathematical Institute |
|
| 2007-09-06 |
New Bounds for MAX-SAT by Clause Learning
2nd International Computer Science Symposium in Russia |
|
| 2006-11-22 |
Efficient Approaches to Proving Upper Bounds for NP-hard Problems
Czech Academy of Sciences |
|
| 2006-01-26 |
Efficient Approaches to Proving Upper Bounds for NP-hard Problems
City University of New York |
|
| 2006-01-22 |
New Approach to Proving Upper Bounds for MAX-2-SAT
SODA |