Approximation Algorithms for Noncommutative CSPs
(opens in new window)
Author(s):
Eric Culf, Hamoon Mousavi, Taro Spirig
Published in:
2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024
Publisher:
IEEE
DOI:
10.1109/FOCS61266.2024.00061
Approximate Degree Composition for Recursive Functions.
(opens in new window)
Author(s):
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, and Nitin Saurabh.
Published in:
2024
Publisher:
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI:
10.4230/LIPICS.APPROX/RANDOM.2024.71
On the Communication Complexity of Finding a King in a Tournament.
(opens in new window)
Author(s):
Nikhil S. Mande, Manaswi Paraashar, Swagato Sanyal, and Nitin Saurabh.
Published in:
2024
Publisher:
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI:
10.4230/LIPICS.APPROX/RANDOM.2024.64
A Quantum Unique Games Conjecture
(opens in new window)
Author(s):
Mousavi, Hamoon; Spirig, Taro
Published in:
16th Innovations in Theoretical Computer Science Conference (ITCS 2025), 2024
Publisher:
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI:
10.48550/ARXIV.2409.20028