Travelled to:1 × Canada
1 × Greece
1 × Switzerland
1 × United Kingdom
4 × USA
Collaborated with:L.Fortnow R.Chen S.Srinivasan M.J.Jansen ∅ Y.Filmus T.Pitassi H.Buhrman I.Bezáková A.Kalai L.Trevisan
Talks about:lower (4) bound (4) succinct (2) circuit (2) frege (2) class (2) max (2) superpolynomi (1) likelihood (1) hierarchi (1)
Person: Rahul Santhanam
DBLP: Santhanam:Rahul
Contributed to:
2015
201220112009
20082007
20062005Wrote 10 papers:
- SAT-2015-ChenS #algorithm #satisfiability
- Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP (RC, RS), pp. 33–45.
- ICALP-v1-2012-SanthanamS #on the
- On the Limits of Sparsification (RS, SS), pp. 774–785.
- ICALP-v1-2011-FilmusPS #bound #exponential
- Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds (YF, TP, RS), pp. 618–629.
- ICALP-v1-2011-FortnowS #robust #simulation
- Robust Simulations and Significant Separations (LF, RS), pp. 569–580.
- ICALP-v1-2011-JansenS #constant #polynomial
- Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (MJJ, RS), pp. 724–735.
- ICALP-v1-2009-BuhrmanFS #bound
- Unconditional Lower Bounds against Advice (HB, LF, RS), pp. 195–209.
- STOC-2008-FortnowS
- Infeasibility of instance compression and succinct PCPs for NP (LF, RS), pp. 133–142.
- STOC-2007-Santhanam #bound
- Circuit lower bounds for Merlin-Arthur classes (RS), pp. 275–283.
- ICML-2006-BezakovaKS #graph #using
- Graph model selection using maximum likelihood (IB, AK, RS), pp. 105–112.
- STOC-2005-FortnowST #semantics
- Hierarchies for semantic classes (LF, RS, LT), pp. 348–355.