|
121 |
Indo UK workshop on Computational Complexity Theory |
Role of composition in PCP constructions |
Prahladh Harsha |
9 Jan 2015 |
|
122 |
Indo UK workshop on Computational Complexity Theory |
Satisfiability algorithms and lower bounds for boolean formulas |
Ruiwen Chen |
8 Jan 2015 |
|
123 |
Indo UK workshop on Computational Complexity Theory |
Symmetric Circuits |
Anuj Dawar |
8 Jan 2015 |
|
124 |
Indo UK workshop on Computational Complexity Theory |
The Complexity of the Simplex Method |
Rahul Savani |
7 Jan 2015 |
|
125 |
Indo UK workshop on Computational Complexity Theory |
The complexity of Valued CSPs |
Stanislav Zivny |
6 Jan 2015 |
|
126 |
Indo UK workshop on Computational Complexity Theory |
The Dynamic Complexity of Reachability and related problems |
Samir Datta |
7 Jan 2015 |
|
127 |
Indo UK workshop on Computational Complexity Theory |
The power of super logarithmic number of players |
Arkadev Chattopadhyay |
9 Jan 2015 |
|
128 |
Indo UK workshop on Computational Complexity Theory |
The shifted partial derivative complexity of elementary symmetric polynomials |
Nutan Limaye |
5 Jan 2015 |
|
129 |
Indo UK workshop on Computational Complexity Theory |
Tribes is hard in Message Passing Model |
Sagnik Mukhopadhyay |
5 Jan 2015 |
|
130 |
Indo UK workshop on Computational Complexity Theory |
Weighing Schemes and NL vs UL problem |
Jayalal Sarma |
9 Jan 2015 |
