( en | de | ru )

 

Disambiguation of "Ablayev, Farid M."

Author of the publication

copydeleteadd this publication to your clipboard
On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions.

, , and . Electron. Colloquium Comput. Complex., (2008)

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.

Adel Farid

Jamail Faridi-Araghi

Rostam Faridani

Ahmed Farid

Marcus Faridi

 

Other publications of authors with the same name

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)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)Lower Bounds for One-Way Probabilistic Communication Complexity and Their Application to Space Complexity.. Theor. Comput. Sci., 157 (2): 139-159 (1996)Algorithms for Quantum Branching Programs Based on Fingerprinting., and . Int. J. Softw. Informatics, 7 (4): 485-500 (2013)On the computational power of probabilistic and quantum branching program., , , , and . Inf. Comput., 203 (2): 145-162 (2005)Classical Simulation Complexity of Quantum Branching Programs.. Algebraic Methods in Computational Complexity, volume 07411 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2007)Lower Bound and Hierarchies for Quantum Ordered Read-k-times Branching Programs., , and . CoRR, (2017)Quantum and Stochastic Branching Programs of Bounded Width., , and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 343-354. Springer, (2002)Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs.. ICALP, volume 1256 of Lecture Notes in Computer Science, page 195-202. Springer, (1997)