( en | de | ru )

 

Disambiguation of "Koroth, Sajin"

Author of the publication

copydeleteadd this publication to your clipboard
Toward Probabilistic Checking against Non-Signaling Strategies with Constant Locality.

, , and . Electron. Colloquium Comput. Complex., (2020)

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.

No persons found for author name Koroth, Sajin
add a person with the name Koroth, Sajin
 

Other publications of authors with the same name

Depth Lower Bounds against Circuits with Sparse Orientation., and . Electron. Colloquium Comput. Complex., (2014)Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates., , , , and . CCC, volume 169 of LIPIcs, page 15:1-15:41. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A Study on Hierarchical Floorplans of Order k, and . CoRR, (2011)A study on the number of Hierarchical Rectangular Partitions of Order k, and . CoRR, (2011)Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates., , , , and . ACM Trans. Comput. Theory, 13 (4): 23:1-23:37 (2021)Toward Probabilistic Checking against Non-Signaling Strategies with Constant Locality., , and . Electron. Colloquium Comput. Complex., (2020)Automating cutting planes is NP-hard., , , and . STOC, page 68-77. ACM, (2020)Depth Lower Bounds against Circuits with Sparse Orientation., and . Fundam. Informaticae, 152 (2): 123-144 (2017)Query-to-Communication Lifting Using Low-Discrepancy Gadgets., , , , and . Electron. Colloquium Comput. Complex., (2019)Query-to-Communication Lifting Using Low-Discrepancy Gadgets., , , , and . SIAM J. Comput., 50 (1): 171-210 (2021)