|
131 |
Indo UK workshop on Computational Complexity Theory |
Fixed Point Computation Problems for Algebraically Defined Functions |
Kousha Etessami |
7 Jan 2015 |
|
132 |
Indo UK workshop on Computational Complexity Theory |
Fourier Dimension and sparsity |
Swagato Sanyal |
5 Jan 2015 |
|
133 |
Indo UK workshop on Computational Complexity Theory |
Lower bounds for non commutative skew circuits |
Srikanth Srinivasan |
5 Jan 2015 |
|
134 |
Indo UK workshop on Computational Complexity Theory |
Lower bounds for small depth arithmetic circuits |
Chandan saha |
5 Jan 2015 |
|
135 |
Indo UK workshop on Computational Complexity Theory |
Phase transitions and the complexity of approximating partition functions |
Leslie Goldberg |
23 Aug 1901 |
|
136 |
Indo UK workshop on Computational Complexity Theory |
Polynomial Identity Testing for a sum of ROABPs |
Arpita Korwar |
8 Jan 2015 |
|
137 |
Indo UK workshop on Computational Complexity Theory |
Proof complexity |
Olaf Beyersdorff |
8 Jan 2015 |
|
138 |
Indo UK workshop on Computational Complexity Theory |
Proof complexity of resolution-based QBF calculi |
Leroy Chew |
8 Jan 2015 |
|
139 |
ICLA International Conference on Logic and its Applications |
Constructive decision theory with subjective states and outcomes |
Joseph Halpern |
10 Jan 2013 |
|
140 |
ICLA International Conference on Logic and its Applications |
Contributed talk by Soma Dutta and Invited talk |
Mark Reynolds |
11 Jan 2013 |
