BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Croatia
3 × USA
Collaborated with:
C.Saha N.Saxena S.Akshay B.Genest P.S.Thiagarajan R.Saptharishi E.Allender R.Impagliazzo T.Pitassi S.Rudich
Talks about:
depth (3) set (3) hit (3) formula (2) circuit (2) transcend (1) polynomi (1) jacobian (1) approxim (1) complex (1)

Person: Manindra Agrawal

DBLP DBLP: Agrawal:Manindra

Contributed to:

STOC 20132013
LICS 20122012
STOC 20122012
STOC 19971997

Wrote 4 papers:

Quasi-polynomial hitting-set for set-depth-Δ formulas (MA, CS, NS), pp. 321–330.
LICS-2012-AgrawalAGT #approximate #markov #verification
Approximate Verification of the Symbolic Dynamics of Markov Chains (MA, SA, BG, PST), pp. 55–64.
STOC-2012-AgrawalSSS #bound
Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits (MA, CS, RS, NS), pp. 599–614.
STOC-1997-AgrawalAIPR #complexity #reduction
Reducing the Complexity of Reductions (MA, EA, RI, TP, SR), pp. 730–738.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.