Amey Bhangale
Título
Citado por
Citado por
Año
The complexity of computing the minimum rank of a sign pattern matrix
A Bhangale, S Kopparty
arXiv preprint arXiv:1503.04486, 2015
172015
Bi-Covering: Covering Edges with Two Small Subsets of Vertices
A Bhangale, R Gandhi, MT Hajiaghayi, R Khandekar, G Kortsarz
SIAM Journal on Discrete Mathematics 31 (4), 2626-2646, 2017
152017
Improved inapproximability of rainbow coloring
P Austrin, A Bhangale, A Potukuchi
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
142020
NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many Colors
A Bhangale
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
122018
Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex Proofs
A Bhangale, P Harsha, O Paradise, A Tal
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
112020
Cube vs. cube low degree test
A Bhangale, I Dinur, IL Navon
arXiv preprint arXiv:1612.07491, 2016
82016
Simultaneous approximation of constraint satisfaction problems
A Bhangale, S Kopparty, S Sachdeva
International Colloquium on Automata, Languages, and Programming, 193-205, 2015
82015
On fortification of projection games
A Bhangale, R Saptharishi, G Varma, R Venkat
arXiv preprint arXiv:1504.05556, 2015
82015
Near-optimal approximation algorithm for simultaneous Max-Cut
A Bhangale, S Khot, S Kopparty, S Sachdeva, D Thiruvenkatachari
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
72018
Simplified inpproximability of hypergraph coloring via t-agreeing families
P Austrin, A Bhangale, A Potukuchi
arXiv preprint arXiv:1904.01163, 2019
62019
UG-Hardness to NP-Hardness by Losing Half
A Bhangale, S Khot
34th Computational Complexity Conference (CCC 2019), 2019
52019
An Improved Dictatorship Test with Perfect Completeness
A Bhangale, S Khot, D Thiruvenkatachari
arXiv preprint arXiv:1702.04748, 2017
42017
A Characterization of Hard-to-cover CSPs
A Bhangale, P Harsha, G Varma
arXiv preprint arXiv:1411.7747, 2014
22014
Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut
A Bhangale, S Khot
35th Computational Complexity Conference (CCC 2020), 2020
12020
Optimal inapproximability of satisfiable k-LIN over non-abelian groups
A Bhangale, S Khot
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
2021
A Characterization of Hard-to-Cover CSPs
A Bhangale, P Harsha, G Varma
Theory of Computing 16 (1), 1-30, 2020
2020
Hardness of Approximation of (Multi-) LCS over Small Alphabet
A Bhangale, D Chakraborty, R Kumar
arXiv preprint arXiv:2006.13449, 2020
2020
Rigid Matrices From Rectangular PCPs
A Bhangale, P Harsha, O Paradise, A Tal
arXiv preprint arXiv:2005.03123, 2020
2020
A Note on the Joint Entropy of N/2-Wise Independence
A Bhangale, A Potukuchi
2018 IEEE International Symposium on Information Theory (ISIT), 2560-2564, 2018
2018
Property Testing, PCPs and CSPs
A Bhangale
Rutgers The State University of New Jersey-New Brunswick, 2017
2017
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20