IMSc
Video Portal Page
Home
Mathematics
Physics
TCS
Computational Biology
Others
Login
Photos
You are here
Home
» Indo UK workshop on Computational Complexity Theory
Indo UK workshop on Computational Complexity Theory
Recent results on depth reduction and lower bounds in arithmetic complexity.
Proof complexity of resolution-based QBF calculi
Comparator circuits over lattices
Fixed Point Computation Problems for Algebraically Defined Functions
Fourier Dimension and sparsity
Lower bounds for non commutative skew circuits
Lower bounds for small depth arithmetic circuits
Phase transitions and the complexity of approximating partition functions
Polynomial Identity Testing for a sum of ROABPs
Proof complexity
Pages
« first
‹ previous
1
2
3
next ›
last »
Copyright © 2022, IMSc.