probabilistically-checkable-proofs
Publications
Jan, 2016
Hardness of Approximate Coloring
Phd Thesis advised by Prof. Prahlad Harsha
Supported by Google India Phd Fellowship in Algorithms
Tata Institute of Fundamental Research, Mumbai.
![Thumbnail [200x250]](/img/thesis.png)
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]](/img/hypergraph.png)
Aug, 2015
On Fortification of Projection Games
Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat
Randomization and Computation (RANDOM'15)