( en | de | ru )

 

Disambiguation of "Ablayev, Farid M."

Author of the publication

copydeleteadd this publication to your clipboard
Randomization and nondeterminsm are incomparable for ordered read-once branching programs

. Electron. Colloquium Comput. Complex., (1997)

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. You can also use the button next to the name to display some publications already assigned to the person.

Jamail Faridi-Araghi

Rostam Faridani

Adel Farid

Marcus Faridi

Ahmed Farid

 

Other publications of authors with the same name

A Discrete Approximation and Communication Complexity Approach to the Superposition Problem., and . FCT, volume 2138 of Lecture Notes in Computer Science, page 47-58. Springer, (2001)On the Lower Bounds for One-Way Quantum Automata., and . MFCS, volume 1893 of Lecture Notes in Computer Science, page 132-140. Springer, (2000)Classical and Quantum Computations with Restricted Memory., , , and . Adventures Between Lower Bounds and Higher Altitudes, volume 11011 of Lecture Notes in Computer Science, page 129-155. Springer, (2018)On quantum methods for machine learning problems part I: Quantum tools., , , , , and . Big Data Min. Anal., 3 (1): 41-55 (2020)Lower Bounds for One-Way Probabilistic Communication Complexity and Their Application to Space Complexity.. Theor. Comput. Sci., 157 (2): 139-159 (1996)Randomization and nondeterminsm are incomparable for ordered read-once branching programs. Electron. Colloquium Comput. Complex., (1997)Computing Boolean Functions via Quantum Hashing., and . Computing with New Resources, volume 8808 of Lecture Notes in Computer Science, page 149-160. Springer, (2014)Classical and Quantum Parallelism in the Quantum Fingerprinting Method., and . PaCT, volume 6873 of Lecture Notes in Computer Science, page 1-12. Springer, (2011)On the Power of Randomized Branching Programs., and . ICALP, volume 1099 of Lecture Notes in Computer Science, page 348-356. Springer, (1996)Complexity of Quantum Uniform and Nonuniform Automata., and . Developments in Language Theory, volume 3572 of Lecture Notes in Computer Science, page 78-87. Springer, (2005)