( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On quantum methods for machine learning problems part I: Quantum tools.

, , , , , и . Big Data Min. Anal., 3 (1): 41-55 (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.

Adel Farid

Jamail Faridi-Araghi

Rostam Faridani

Ahmed Farid

Marcus Faridi

 

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

A Discrete Approximation and Communication Complexity Approach to the Superposition Problem., и . FCT, том 2138 из Lecture Notes in Computer Science, стр. 47-58. Springer, (2001)Classical and Quantum Computations with Restricted Memory., , , и . Adventures Between Lower Bounds and Higher Altitudes, том 11011 из Lecture Notes in Computer Science, стр. 129-155. Springer, (2018)On quantum methods for machine learning problems part I: Quantum tools., , , , , и . Big Data Min. Anal., 3 (1): 41-55 (2020)On the Lower Bounds for One-Way Quantum Automata., и . MFCS, том 1893 из Lecture Notes in Computer Science, стр. 132-140. Springer, (2000)Randomization and nondeterminsm are incomparable for ordered read-once branching programs. Electron. Colloquium Comput. Complex., (1997)Lower Bounds for One-Way Probabilistic Communication Complexity and Their Application to Space Complexity.. Theor. Comput. Sci., 157 (2): 139-159 (1996)Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach.. LFCS, том 813 из Lecture Notes in Computer Science, стр. 1-7. Springer, (1994)Complexity of Quantum Uniform and Nonuniform Automata., и . Developments in Language Theory, том 3572 из Lecture Notes in Computer Science, стр. 78-87. Springer, (2005)Quantum-Assisted Blockchain., , , , и . CoRR, (2018)A Discrete Approximation and Communication Complexity Approach to the Superposition Problem, и . Electron. Colloquium Comput. Complex., (1998)