Author of the publication

On the Lower Bounds for One-Way Quantum Automata.

, and . MFCS, volume 1893 of Lecture Notes in Computer Science, page 132-140. Springer, (2000)

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.

 

Other publications of authors with the same name

On the Lower Bounds for One-Way Quantum Automata., and . MFCS, volume 1893 of Lecture Notes in Computer Science, page 132-140. Springer, (2000)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)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)Lower Bound and Hierarchies for Quantum Ordered Read-k-times Branching Programs., , and . CoRR, (2017)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)On Complexity of Regular (1,+k)-Branching Programs. Electron. Colloquium Comput. Complex., (1999)