Nitin Saurabh
Title
Cited by
Cited by
Year
An improved deterministic# SAT algorithm for small De Morgan formulas
R Chen, V Kabanets, N Saurabh
Algorithmica 76 (1), 68-87, 2016
272016
Homomorphism Polynomials complete for VP
A Durand, M Mahajan, G Malod, N de Rugy-Altherre, N Saurabh
Chicago Journal of Theoretical Computer Science 2016 (3), 2016
172016
Some complete and intermediate polynomials in algebraic complexity theory
M Mahajan, N Saurabh
Theory of Computing Systems 62 (3), 622-652, 2018
162018
Upper bounds on Fourier entropy
S Chakraborty, R Kulkarni, SV Lokam, N Saurabh
Theoretical Computer Science 654, 92-112, 2016
152016
Improved bounds on Fourier entropy and Min-entropy
S Arunachalam, S Chakraborty, M Kouckż, N Saurabh, R de Wolf
arXiv preprint arXiv:1809.09819, 2018
82018
Algebraic branching programs, border complexity, and tangent spaces
M Bläser, C Ikenmeyer, M Mahajan, A Pandey, N Saurabh
arXiv preprint arXiv:2003.04834, 2020
52020
Lower bounds for linear decision lists
A Chattopadhyay, M Mahajan, N Mande, N Saurabh
arXiv preprint arXiv:1901.05911, 2019
42019
Fourier entropy-influence conjecture for random linear threshold functions
S Chakraborty, S Karmalkar, S Kundu, SV Lokam, N Saurabh
Latin American Symposium on Theoretical Informatics, 275-289, 2018
42018
Counting paths in planar width 2 branching programs
M Mahajan, N Saurabh, K Sreenivasaiah
32011
Counting paths in planar width 2 branching programs
M Mahajan, N Saurabh, K Sreenivasaiah
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium …, 2012
22012
On the complexity of detecting hazards
B Komarath, N Saurabh
Information Processing Letters 162, 105980, 2020
12020
Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity
D Chakraborty, D Das, M Kouckż, N Saurabh
26th Annual European Symposium on Algorithms (ESA 2018), 2018
12018
Optimal Quasi-Gray Codes: Does the Alphabet Matter?
D Chakraborty, D Das, M Kouckż, N Saurabh
arXiv preprint arXiv:1712.01834, 2017
12017
VNP= VP in the multilinear world
M Mahajan, N Saurabh, S Tavenas
Information Processing Letters 116 (2), 179-182, 2016
12016
Analysis of Algebraic complexity classes and boolean functions [HBNI Th106]
N Saurabh
IMSc, 2016
12016
Improved Bounds on Fourier Entropy and Min-entropy
S Arunachalam, S Chakraborty, M Kouckż, N Saurabh, R De Wolf
ACM Transactions on Computation Theory (TOCT) 13 (4), 1-40, 2021
2021
Karchmer-Wigderson Games for Hazard-free Computation
C Ikenmeyer, B Komarath, N Saurabh
arXiv preprint arXiv:2107.05128, 2021
2021
Approximate polymorphisms
G Chase, Y Filmus, D Minzer, E Mossel, N Saurabh
arXiv preprint arXiv:2106.00093, 2021
2021
Optimal Quasi-Gray Codes: The Alphabet Matters
D Chakraborty, D Das, M Kouckż, N Saurabh
arXiv preprint arXiv:1712.01834, 2017
2017
Improved bounds on Fourier entropy and
S Arunachalam, S Chakraborty, M Kouckż, N Saurabh, R de Wolf
The system can't perform the operation now. Try again later.
Articles 1–20