71 |
Indo UK workshop on Computational Complexity Theory |
Lower bounds for small depth arithmetic circuits |
Chandan saha |
5 Jan 2015 |

72 |
Indo UK workshop on Computational Complexity Theory |
Phase transitions and the complexity of approximating partition functions |
Leslie Goldberg |
23 Aug 1901 |

73 |
Indo UK workshop on Computational Complexity Theory |
Polynomial Identity Testing for a sum of ROABPs |
Arpita Korwar |
8 Jan 2015 |

74 |
Indo UK workshop on Computational Complexity Theory |
Proof complexity |
Olaf Beyersdorff |
8 Jan 2015 |

75 |
Indo UK workshop on Computational Complexity Theory |
Proof complexity of resolution-based QBF calculi |
Leroy Chew |
8 Jan 2015 |

76 |
Indo UK workshop on Computational Complexity Theory |
Recent results on depth reduction and lower bounds in arithmetic complexity. |
Neeraj Kayal |
5 Jan 2015 |

77 |
Indo UK workshop on Computational Complexity Theory |
Role of composition in PCP constructions |
Prahladh Harsha |
9 Jan 2015 |

78 |
Indo UK workshop on Computational Complexity Theory |
Satisfiability algorithms and lower bounds for boolean formulas |
Ruiwen Chen |
8 Jan 2015 |

79 |
Indo UK workshop on Computational Complexity Theory |
Symmetric Circuits |
Anuj Dawar |
8 Jan 2015 |

80 |
Indo UK workshop on Computational Complexity Theory |
The Complexity of the Simplex Method |
Rahul Savani |
7 Jan 2015 |