Nitin Saurabh

Available identifiers

Publication	Date of Publication	Type
On the composition of randomized query complexity and approximate degree	2025-01-14	Paper
Karchmer-Wigderson games for hazard-free computation	2024-09-25	Paper
Rabbits approximate, cows compute Exactly!	2024-08-06	Paper
Tight lower bounds for approximate \& exact \(k\)-center in \(\mathbb{R}^d\)	2024-05-14	Paper
Approximate polymorphisms	2023-12-08	Paper
Improved Bounds on Fourier Entropy and Min-Entropy	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5092471	2022-07-21	Paper
Improved Bounds on Fourier Entropy and Min-entropy	2022-03-29	Paper
Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4988300	2021-05-14	Paper
On the complexity of detecting hazards	2020-10-07	Paper
Fourier entropy influence conjecture for random linear threshold functions	2020-02-12	Paper
Some complete and intermediate polynomials in algebraic complexity theory	2018-06-01	Paper
Homomorphism Polynomials Complete for VP	2017-04-25	Paper
Upper bounds on Fourier entropy	2016-11-24	Paper
An improved deterministic \#SAT algorithm for small De Morgan formulas	2016-11-01	Paper
Some complete and intermediate polynomials in algebraic complexity theory	2016-07-25	Paper
Homomorphism polynomials complete for VP	2016-05-24	Paper
\textsf{VNP} = \textsf{VP} in the multilinear world	2015-12-01	Paper
Upper Bounds on Fourier Entropy	2015-10-29	Paper
An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas	2014-10-14	Paper

This page was built for person: Nitin Saurabh