Saurabh, Nitin

1. Some Complete and Intermediate Polynomials in Algebraic Complexity Theory
   2016/03/15 by Mahajan, Meena, Saurabh, Nitin · 1 citation
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences
2. Algebraic Branching Programs, Border Complexity, and Tangent Spaces
   2020/03/10 by Bläser, Markus, Ikenmeyer, Christian, Mahajan, Meena +2 · 1 citation
   #Computational Complexity (cs.CC) #F.1.1 #F.1.3 #FOS: Computer and information sciences
3. Approximate polymorphisms
   2021/05/31 by Chase, Gilad, Filmus, Yuval, Minzer, Dor +2 · 1 citation
   #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
4. Randomized and quantum query complexities of finding a king in a tournament
   2023/08/04 by Mande, Nikhil S., Paraashar, Manaswi, Saurabh, Nitin · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
5. Karchmer-Wigderson Games for Hazard-free Computation
   2021/07/11 by Ikenmeyer, Christian, Komarath, Balagopal, Saurabh, Nitin · 1 citation
   #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #F.1 #FOS: Computer and information sciences