( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Query Complexity of Matroids.

, и . CIAC, том 7878 из Lecture Notes in Computer Science, стр. 300-311. Springer, (2013)

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.

Miklos Scholl

Benedikt Miklos

Miklos Prodan

Miklós Halmágyi

Miklòs Jakobovics

 

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

An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups., , и . LATIN, том 4957 из Lecture Notes in Computer Science, стр. 759-771. Springer, (2008)On the Reversibility of Oblivious Transfer., и . EUROCRYPT, том 547 из Lecture Notes in Computer Science, стр. 106-113. Springer, (1991)Approximate Nash Equilibria for Multi-player Games., , и . SAGT, том 4997 из Lecture Notes in Computer Science, стр. 267-278. Springer, (2008)Query Complexity of Matroids., и . CIAC, том 7878 из Lecture Notes in Computer Science, стр. 300-311. Springer, (2013)Quantum Testers for Hidden Group Properties., , , и . Fundam. Informaticae, 91 (2): 325-340 (2009)Total functions in QMA., и . Quantum Inf. Process., 20 (1): 35 (2021)Quantum algorithms for graph problems with cut queries., , и . SODA, стр. 939-958. SIAM, (2021)On Solving Systems of Diagonal Polynomial Equations Over Finite Fields., и . FAW, том 9130 из Lecture Notes in Computer Science, стр. 125-137. Springer, (2015)Verifying the Determinant in Parallel., и . ISAAC, том 834 из Lecture Notes in Computer Science, стр. 65-73. Springer, (1994)Quantum and classical algorithms for approximate submodular function minimization., , , и . Quantum Inf. Comput., 19 (15&16): 1325-1349 (2019)