 | Up a level |
Bläser, Markus, Ikenmeyer, Christian, Mahajan, Meena, Pandey, Anurag and Saurabh, Nitin
(2020)
Algebraic Branching Programs, Border Complexity, and Tangent Spaces.
In: 35th Computational Complexity Conference (CCC 2020).
Bläser, Markus, Ikenmeyer, Christian, Mahajan, Meena, Pandey, Anurag and Saurabh, Nitin
(2020)
Algebraic Branching Programs, Border Complexity, and Tangent Spaces.
Electronic Colloquium on Computational Complexity (ECCC), 18 (39).
p. 31.
Ikenmeyer, Christian, Komarath, Balagopal and Saurabh, Nitin
(2021)
Karchmer-Wigderson Games for Hazard-free Computation.
[Preprint]
Ikenmeyer, Christian, Komarath, Balagopal and Saurabh, Nitin
(2021)
Karchmer-Wigderson Games for Hazard-free Computation.
Electron. Colloquium Comput. Complex., TR21.
p. 100.
Mande, Nikhil 
ORCID: 0000-0002-9520-7340, Paraashar, Manaswi and Saurabh, Nitin
(2023)
Randomized and quantum query complexities of finding a king in a tournament.
In: FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 2023-12-18 - 2023-12-20, Hyderabad, India.