activity
20112021
most citedQuasi-polynomial Hitting-set for Set-depth-Delta Formulas

3 citations · 8 across the 7 of their papers we have counts for

collaborators

7 papers

q-bio.PE2021★ 1 cited

SUTRA: A Novel Approach to Modelling Pandemics with Applications to COVID-19

Manindra Agrawal, Madhuri Kanitkar, Deepu Phillip +5

The Covid-19 pandemic has two key properties: (i) asymptomatic cases (both detected and undetected) that can result in new infections, and (ii) time-varying characteristics due to…

cs.DS2018

The Query Complexity of a Permutation-Based Variant of Mastermind

Peyman Afshani, Manindra Agrawal, Benjamin Doerr +3

We study the query complexity of a permutation-based variant of the guessing game Mastermind. In this variant, the secret is a pair which consists of a binary string $z \in…

cs.CC2017★ 1 cited

Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good

Manindra Agrawal, Michael Forbes, Sumanta Ghosh +1

We show that if we can design poly()-time hitting-sets for circuits of size , where is arbitrarily small and the number of variables, or ar…

cs.CC2014★ 1 cited

Hitting-sets for ROABP and Sum of Set-Multilinear circuits

Manindra Agrawal, Rohit Gurjar, Arpita Korwar +1

We give a -time ( is the input size) blackbox polynomial identity testing algorithm for unknown-order read-once oblivious algebraic branching programs (ROABP). Th…

cs.CC2013★ 1 cited

Hitting-sets for low-distance multilinear depth-3

Manindra Agrawal, Rohit Gurjar, Arpita Korwar +1

The depth- model has recently gained much importance, as it has become a stepping-stone to understanding general arithmetic circuits. Its restriction to multilinearity has known…

cs.CC2012★ 3 cited

Quasi-polynomial Hitting-set for Set-depth-Delta Formulas

Manindra Agrawal, Chandan Saha, Nitin Saxena

We call a depth-4 formula C set-depth-4 if there exists a (unknown) partition (X_1,...,X_d) of the variable indices [n] that the top product layer respects, i.e. C(x) = \sum_{i=1}^…