( en | de | ru )

 

Disambiguation of "Santhanam, Rahul"

Author of the publication

copydeleteadd this publication to your clipboard
Branching Programs for Tree Evaluation.

, , , , and . MFCS, volume 5734 of Lecture Notes in Computer Science, page 175-186. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Parthiban Santhanam

Rahul Gupta

Rahul Dewan

Rahul Ray

Rahul Bahulikar

 

Other publications of authors with the same name

Robust simulations and significant separations., and . Inf. Comput., (2017)Graph model selection using maximum likelihood, , and . ICML '06: Proceedings of the 23rd international conference on Machine learning, page 105--112. New York, NY, USA, ACM, (2006)Why are Proof Complexity Lower Bounds Hard?, and . FOCS, page 1305-1324. IEEE Computer Society, (2019)Pebbles and Branching Programs for Tree Evaluation., , , , and . TOCT, 3 (2): 4:1-4:43 (2012)Branching Programs for Tree Evaluation., , , , and . MFCS, volume 5734 of Lecture Notes in Computer Science, page 175-186. Springer, (2009)Hardness Magnification Near State-of-the-Art Lower Bounds., , and . Theory Comput., (2021)Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111)., , , , and . Dagstuhl Reports, 13 (3): 17-31 (March 2023)Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth., and . ICALP (1), volume 6755 of Lecture Notes in Computer Science, page 724-735. Springer, (2011)Robust Simulations and Significant Separations., and . ICALP (1), volume 6755 of Lecture Notes in Computer Science, page 569-580. Springer, (2011)Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds., , and . ICALP (1), volume 6755 of Lecture Notes in Computer Science, page 618-629. Springer, (2011)