14 citations · 17 across the 3 of their papers we have counts for
4 papers
On the Probabilistic Degrees of Symmetric Boolean functions
Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
The probabilistic degree of a Boolean function is defined to be the smallest such that there is a random polynomial of degree at m…
Decoding Downset codes over a finite grid
Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a genera…
Fully Automated Image De-fencing using Conditional Generative Adversarial Networks
Divyanshu Gupta, Shorya Jain, Utkarsh Tripathi +2
Image de-fencing is one of the important aspects of recreational photography in which the objective is to remove the fence texture present in an image and generate an aesthetically…
A Fixed-Depth Size-Hierarchy Theorem for AC via the Coin Problem
Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan +2
We prove the first Fixed-depth Size-hierarchy Theorem for uniform AC circuits; in particular, for fixed , the class of uniform AC for…