( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Exponential Time Paradigms Through the Polynomial Time Lens.

, , и . ESA, том 57 из LIPIcs, стр. 36:1-36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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

 

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

Infeasibility of instance compression and succinct PCPs for NP., и . STOC, стр. 133-142. ACM, (2008)Marginal hitting sets imply super-polynomial lower bounds for permanent., и . ITCS, стр. 496-506. ACM, (2012)Bounding Rationality by Discounting Time., и . ICS, стр. 143-155. Tsinghua University Press, (2010)Graph model selection using maximum likelihood., , и . ICML, том 148 из ACM International Conference Proceeding Series, стр. 105-112. ACM, (2006)Expander-Based Cryptography Meets Natural Proofs., , и . ITCS, том 124 из LIPIcs, стр. 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Majority is incompressible by AC0p circuits., и . Electron. Colloquium Comput. Complex., (2014)Unconditional Lower Bounds against Advice., , и . Algebraic Methods in Computational Complexity, том 09421 из Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds., , и . MFCS, том 117 из LIPIcs, стр. 78:1-78:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Iterated lower bound formulas: a diagonalization-based approach to proof complexity., и . STOC, стр. 234-247. ACM, (2021)On the Average-Case Complexity of MCSP and Its Variants., и . CCC, том 79 из LIPIcs, стр. 7:1-7:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)