Author of the publication

Mortality for 2×2 Matrices Is NP-Hard.

, , and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 148-159. Springer, (2012)

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

An Introduction to Quantum Computing.. Bulletin of the EATCS, (1998)Mortality for 2×2 Matrices Is NP-Hard., , and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 148-159. Springer, (2012)Interference as a computational resource: a tutorial.. Nat. Comput., 17 (1): 201-219 (2018)Quantum Automata with Open Time Evolution.. IJNCR, 1 (1): 70-85 (2010)Recurrent Construction of MacWilliams and Chebyshev Matrices., and . Fundam. Informaticae, 116 (1-4): 93-110 (2012)Mathematics for Quantum Information Processing.. Handbook of Natural Computing, Springer, (2012)Universality and Quantum Computing.. Bulletin of the EATCS, (2002)Marked PCP is decidable., , and . Theor. Comput. Sci., 255 (1-2): 193-204 (2001)Various Aspects of Finite Quantum Automata.. Developments in Language Theory, volume 5257 of Lecture Notes in Computer Science, page 21-33. Springer, (2008)Quantum computing.. Natural computing series Springer, (2001)