I agree that this site is using cookies. You can find further informations here.
X
Bhangale, Amey
55  results:
Search for persons X
?
1

Rigid Matrices from Rectangular PCPs:

Bhangale, Amey ; Harsha, Prahladh ; Paradise, Orr.
SIAM Journal on Computing.  53 (2024)  2 - p. 480-523 , 2024
Link: https://doi.org/10.1137/..
 
?
2

On Approximability of Satisfiable k-CSPs: IV:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Bhangale, Amey ; Khot, Subhash ; Minzer, Dor - p. 1423-1434 , 2024
Link: https://dl.acm.org/doi/1..
 
?
3

Max-3-Lin Over Non-abelian Groups with Universal Factor Gra..:

Bhangale, Amey ; Stanković, Aleksa
Algorithmica.  85 (2023)  9 - p. 2693-2734 , 2023
Link: https://doi.org/10.1007/..
 
?
4

On Approximability of Satisfiable k-CSPs: II:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Bhangale, Amey ; Khot, Subhash ; Minzer, Dor - p. 632-642 , 2023
Link: https://dl.acm.org/doi/1..
 
?
5

On Approximability of Satisfiable k-CSPs: III:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Bhangale, Amey ; Khot, Subhash ; Minzer, Dor - p. 643-655 , 2023
Link: https://dl.acm.org/doi/1..
 
?
6

On approximability of satisfiable k-CSPs: I:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Bhangale, Amey ; Khot, Subhash ; Minzer, Dor - p. 976-988 , 2022
Link: https://dl.acm.org/doi/1..
 
?
7

A Toolbox for Barriers on Interactive Oracle Proofs:

, In: Theory of Cryptography; Lecture Notes in Computer Science,
Arnon, Gal ; Bhangale, Amey ; Chiesa, Alessandro. - p. 447-466 , 2022
Link: https://doi.org/10.1007/..
 
?
8

Efficient Adaptively-Secure Byzantine Agreement for Long Me..:

, In: Advances in Cryptology – ASIACRYPT 2022; Lecture Notes in Computer Science,
Bhangale, Amey ; Liu-Zhang, Chen-Da ; Loss, Julian. - p. 504-525 , 2022
Link: https://doi.org/10.1007/..
 
?
9

Optimal inapproximability of satisfiable k-LIN over non-abe..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Bhangale, Amey ; Khot, Subhash - p. 1615-1628 , 2021
Link: https://dl.acm.org/doi/1..
 
?
10

Rigid Matrices From Rectangular PCPs or: Hard Claims Have C..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Bhangale, Amey ; Harsha, Prahladh ; Paradise, Orr. - p. 858-869 , 2020
Link: https://doi.org/10.1109/..
 
?
11

Improved inapproximability of rainbow coloring:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Austrin, Per ; Bhangale, Amey ; Potukuchi, Aditya - p. 1479-1495 , 2020
Link: https://dl.acm.org/doi/1..
 
?
12

Simultaneous max-cut is harder to approximate than max-cut:

, In: Proceedings of the 35th Computational Complexity Conference,
Bhangale, Amey ; Khot, Subhash - p. 1-15 , 2020
Link: https://dl.acm.org/doi/1..
 
?
13

UG-hardness to NP-hardness by losing half:

, In: Proceedings of the 34th Computational Complexity Conference,
Bhangale, Amey ; Khot, Subhash - p. 1-20 , 2019
Link: https://dl.acm.org/doi/1..
 
?
14

Near-optimal approximation algorithm for simultaneous Max-C..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Bhangale, Amey ; Khot, Subhash ; Kopparty, Swastik.. - p. 1407-1425 , 2018
Link: https://dl.acm.org/doi/1..
 
?
15

Near-optimal approximation algorithm for simultaneous Max-C..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Bhangale, Amey ; Khot, Subhash ; Kopparty, Swastik.. - p. 1407-1425 , 2018
Link: https://doi.org/10.1137/..
 
1-15