( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Pseudorandom Bits for Oblivious Branching Programs.

, и . TOCT, 12 (2): 8:1-8:12 (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.

Rohit Sinha

Rohit Gupta

Rohit Ghai

Rohit Soni

Rohit Datta

 

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

Pseudorandom Bits for Oblivious Branching Programs., и . Electron. Colloquium Comput. Complex., (2017)Pseudorandom Bits for Oblivious Branching Programs., и . TOCT, 12 (2): 8:1-8:12 (2020)A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision., , и . SODA, стр. 1013-1035. SIAM, (2022)Border Complexity of Symbolic Determinant Under Rank One Restriction., , , и . CCC, том 264 из LIPIcs, стр. 2:1-2:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A deterministic parallel algorithm for bipartite perfect matching., , и . Commun. ACM, 62 (3): 109-115 (2019)Impossibility of Derandomizing the Isolation Lemma for all Families., , и . Electron. Colloquium Comput. Complex., (2020)A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision., , и . Algorithmica, 86 (4): 1057-1079 (апреля 2024)Improved Explicit Hitting-Sets for ROABPs., и . APPROX-RANDOM, том 176 из LIPIcs, стр. 4:1-4:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits., , , и . SIAM J. Comput., 44 (3): 669-697 (2015)Fractional Linear Matroid Matching is in quasi-NC., , и . CoRR, (2024)