Probabilistically Checkable Proofs


Dec, 2016

Hardness of Approximate Coloring

Phd Thesis advised by Prof. Prahlad Harsha
Suppored by Google India Phd Fellowship in Algorithms
Tata Institute of Fundamental Research (TIFR), Mumbai.

Thumbnail [200x250]
Dec, 2015

A Characterization of Hard-to-cover CSPs

Amey Bhangale, Prahladh Harsha, Girish Varma
Theory of Computing Journal (ToC)
Computational Complexity Conference (CCC)

Thumbnail [200x250]
Aug, 2015

On Fortification of Projection Games

Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat
Randomization and Computation (RANDOM’15)