IMSc
Video Portal Page
Home
Physics
TCS
Others
Login
Photos
You are here
Home
» Indo UK workshop on Computational Complexity Theory
Indo UK workshop on Computational Complexity Theory
A survey of logical reductions between problems
Satisfiability algorithms and lower bounds for boolean formulas
Symmetric Circuits
The Complexity of the Simplex Method
The complexity of Valued CSPs
The Dynamic Complexity of Reachability and related problems
The power of super logarithmic number of players
The shifted partial derivative complexity of elementary symmetric polynomials
Tribes is hard in Message Passing Model
Role of composition in PCP constructions
Pages
1
2
3
next ›
last »
Copyright © 2024, IMSc.
