( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Optimal Quantum Sample Complexity of Learning Algorithms.

, и . CCC, том 79 из LIPIcs, стр. 25:1-25:31. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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.

Ronald Wolf

Ronald Wolf

Ronald Michael Wolf

Ronald Keipert

Acmella ciliata (H.B.K.) Cassini: phytochemische und enzymatische Untersuchungen, galenische Präformulierungen. FU Berlin, (2009)

Amal Dé

 

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

Quantum Lower Bounds by Polynomials., , , , и . FOCS, стр. 352-361. IEEE Computer Society, (1998)A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs., , и . Algorithmica, 55 (3): 422-461 (2009)Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving., и . FOCS, стр. 637-648. IEEE, (2020)Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error., и . CoRR, (2021)The non-adaptive query complexity of testing k-parities, , , и . CoRR, (2012)Quantum symmetrically-private information retrieval., и . Inf. Process. Lett., 90 (3): 109-114 (2004)A Complete Method for Program Specialization Based on Unfolding., и . ECAI, стр. 438-442. John Wiley and Sons, Chichester, (1996)Error-Correcting Data Structures.. STACS, том 3 из LIPIcs, стр. 313-324. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)Locally Decodable Quantum Codes., и . STACS, том 3 из LIPIcs, стр. 219-230. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)On the Sum-of-Squares Degree of Symmetric Quadratic Functions., , , и . CCC, том 50 из LIPIcs, стр. 17:1-17:31. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)