 | Up a level |
Number of items: 2.
Deligkas, Argyrios, Fearnley, John, Hollender, Alexandros and Melissourgos, Themistoklis
(2022)
Constant Inapproximability for PPA.
In: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing.
Harms, Nathaniel, Wild, Sebastian 
ORCID: 0000-0002-6061-9177 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2022)
Randomized Communication and Implicit Graph Representations.
In: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing.