You are here

TCS

Phase transitions and the complexity of approximating partition functions

Lower bounds for small depth arithmetic circuits

Lower bounds for non commutative skew circuits

Fourier Dimension and sparsity

Fixed Point Computation Problems for Algebraically Defined Functions

Comparator circuits over lattices

A survey of logical reductions between problems

Proof complexity

Proof complexity of resolution-based QBF calculi

Recent results on depth reduction and lower bounds in arithmetic complexity.

Pages

Copyright © 2024, IMSc.