( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing.

, , , и . FOCS, стр. 109-117. IEEE Computer Society, (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.

Neil Garg

Ankit Mittal

Ankit Goyal

Animesh Garg

Dineshkumar Garg

 

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

PrediCalc: A Logical Spreadsheet Management System., , , и . VLDB, стр. 1247-1250. ACM, (2005)Performance Analysis of Erroneous Feedback-Based MIMO System Over Nakagami- $m$ Fading Channels., , , и . IEEE Trans. Commun., 67 (8): 5403-5418 (2019)Public vs private coin in bounded-round information., и . Electron. Colloquium Comput. Complex., (2013)Small value parallel repetition for general games., и . Electron. Colloquium Comput. Complex., (2014)One Bit Imperfect Feedback Based Antenna Cluster Selection for MIMO System over Nakagami-m Fading Channels., , и . IEEE ANTS, стр. 1-6. IEEE, (2020)Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case., , , и . APPROX/RANDOM, том 245 из LIPIcs, стр. 21:1-21:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)From information to exact communication., , , и . STOC, стр. 151-160. ACM, (2013)Public vs Private Coin in Bounded-Round Information., и . ICALP (1), том 8572 из Lecture Notes in Computer Science, стр. 502-513. Springer, (2014)An integrated SRM-multi-gene genetic programming approach for prediction of factor of safety of 3-D soil nailed slopes., , , и . Eng. Appl. Artif. Intell., (2014)Lower Bound on Expected Communication Cost of Quantum Huffman Coding., , , и . TQC, том 61 из LIPIcs, стр. 3:1-3:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)