 | Up a level |
Number of items: 3.
Filos-Ratsikas, Aris 
ORCID: 0000-0001-7868-8114 and Goldberg, Paul W
(2018)
Consensus Halving Is PPA-Complete.
In: STOC '18: Symposium on Theory of Computing, Los Angeles, CA, USa.
Blaeser, Markus, Ikenmeyer, Christian, Jindal, Gorav and Lysikov, Vladimir
(2018)
Generalized Matrix Completion and Algebraic Natural Proofs.
In: STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing.
Ikenmeyer, Christian, Komarath, Balagopal, Lenzen, Christoph, Lysikov, Vladimir, Mokhov, Andrey and Sreenivasaiah, Karteek
(2019)
On the Complexity of Hazard-free Circuits.
JOURNAL OF THE ACM, 66 (4).
pp. 1-20.