Segui
Amey Bhangale
Titolo
Citata da
Citata da
Anno
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
312020
Improved inapproximability of rainbow coloring
P Austrin, A Bhangale, A Potukuchi
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
232020
The complexity of computing the minimum rank of a sign pattern matrix
A Bhangale, S Kopparty
arXiv preprint arXiv:1503.04486, 2015
192015
UG-hardness to NP-hardness by Losing Half
A Bhangale, S Khot
Theory of Computing 18 (1), 1-28, 2022
182022
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
182017
NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many Colors
A Bhangale
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
162018
On approximability of satisfiable k-CSPs: I
A Bhangale, S Khot, D Minzer
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
152022
Cube vs. cube low degree test
A Bhangale, I Dinur, IL Navon
arXiv preprint arXiv:1612.07491, 2016
152016
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
122021
Efficient adaptively-secure byzantine agreement for long messages
A Bhangale, CD Liu-Zhang, J Loss, K Nayak
International Conference on the Theory and Application of Cryptology and …, 2022
112022
Simplified inpproximability of hypergraph coloring via t-agreeing families
P Austrin, A Bhangale, A Potukuchi
arXiv preprint arXiv:1904.01163, 2019
112019
Simultaneous approximation of constraint satisfaction problems
A Bhangale, S Kopparty, S Sachdeva
Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015
112015
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
102018
On fortification of projection games
A Bhangale, R Saptharishi, G Varma, R Venkat
arXiv preprint arXiv:1504.05556, 2015
82015
An Improved Dictatorship Test with Perfect Completeness
A Bhangale, S Khot, D Thiruvenkatachari
arXiv preprint arXiv:1702.04748, 2017
52017
Mixing of 3-term progressions in Quasirandom Groups
A Bhangale, P Harsha, S Roy
arXiv preprint arXiv:2109.12627, 2021
42021
Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut
A Bhangale, S Khot
35th Computational Complexity Conference (CCC 2020), 2020
42020
A Characterization of Hard-to-cover CSPs
A Bhangale, P Harsha, G Varma
arXiv preprint arXiv:1411.7747, 2014
22014
Max-3-lin over non-abelian groups with universal factor graphs
A Bhangale, A Stanković
Algorithmica 85 (9), 2693-2734, 2023
12023
A Toolbox for Barriers on Interactive Oracle Proofs
G Arnon, A Bhangale, A Chiesa, E Yogev
Theory of Cryptography: 20th International Conference, TCC 2022, Chicago, IL …, 2022
12022
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20