( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Automating cutting planes is NP-hard.

, , , и . STOC, стр. 68-77. ACM, (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.

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

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

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