( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Pebbles and Branching Programs for Tree Evaluation.

, , , , и . Logic, Automata, and Computational Complexity, том 43 из ACM Books, ACM, (2023)

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.

Parthiban Santhanam

Rahul Gupta

Rahul Dewan

Rahul Ray

Rahul Bahulikar

 

Другие публикации лиц с тем же именем

Robust simulations and significant separations., и . Inf. Comput., (2017)Why are Proof Complexity Lower Bounds Hard?, и . FOCS, стр. 1305-1324. IEEE Computer Society, (2019)Pebbles and Branching Programs for Tree Evaluation., , , , и . TOCT, 3 (2): 4:1-4:43 (2012)Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth., и . ICALP (1), том 6755 из Lecture Notes in Computer Science, стр. 724-735. Springer, (2011)Robust Simulations and Significant Separations., и . ICALP (1), том 6755 из Lecture Notes in Computer Science, стр. 569-580. Springer, (2011)Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds., , и . ICALP (1), том 6755 из Lecture Notes in Computer Science, стр. 618-629. Springer, (2011)Branching Programs for Tree Evaluation., , , , и . MFCS, том 5734 из Lecture Notes in Computer Science, стр. 175-186. Springer, (2009)Hardness Magnification Near State-of-the-Art Lower Bounds., , и . Theory Comput., (2021)Time Hierarchies: A Survey., и . Electron. Colloquium Comput. Complex., (2007)Beyond Natural Proofs: Hardness Magnification and Locality., , , , , и . J. ACM, 69 (4): 25:1-25:49 (2022)