( en | de | ru )

 

Disambiguation of "Ilango, Rahul"

Author of the publication

copydeleteadd this publication to your clipboard
The Non-hardness of Approximating Circuit Size.

, , and . Theory Comput. Syst., 65 (3): 559-578 (2021)

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.

Rahul Gupta

Rahul Dewan

Rahul Ray

Rahul Bahulikar

Rahul Rithe

 

Other publications of authors with the same name

Hardness on any Samplable Distribution Suffices: New Characterizations of One-Way Functions by Meta-Complexity., , and . Electron. Colloquium Comput. Complex., (2021)The Non-hardness of Approximating Circuit Size., , and . Theory Comput. Syst., 65 (3): 559-578 (2021)The Minimum Formula Size Problem is (ETH) Hard.. FOCS, page 427-432. IEEE, (2021)The Non-hardness of Approximating Circuit Size., , and . CSR, volume 11532 of Lecture Notes in Computer Science, page 13-24. Springer, (2019)Hardness of Constant-Round Communication Complexity., , and . CCC, volume 200 of LIPIcs, page 31:1-31:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic., , and . STOC, page 1076-1089. ACM, (2023)NP-Hardness of Circuit Minimization for Multi-Output Functions., , and . CCC, volume 169 of LIPIcs, page 22:1-22:36. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Beating Brute Force for Compression Problems., , and . Electron. Colloquium Comput. Complex., (2023)NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach., , and . STOC, page 1067-1075. ACM, (2023)Approaching MCSP from Above and Below: Hardness for a Conditional Variant and AC^0p.. ITCS, volume 151 of LIPIcs, page 34:1-34:26. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)