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

On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups., and . Int. J. Found. Comput. Sci., 21 (6): 963-978 (2010)On the Computational Complexity of Matrix Semigroup Problems., and . Fundam. Informaticae, 116 (1-4): 1-13 (2012)Acceptance Ambiguity for Quantum Automata., and . MFCS, volume 138 of LIPIcs, page 70:1-70:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Freeness properties of weighted and probabilistic automata over bounded languages., , and . Inf. Comput., (2019)On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond., , and . Inf. Comput., (2021)Unique decipherability in formal languages., , and . Theor. Comput. Sci., (2020)The continuous Skolem-Pisot problem., , , and . Theor. Comput. Sci., 411 (40-42): 3625-3634 (2010)The membership problem for subsemigroups of GL2(Z) is NP-complete., , and . Inf. Comput., (January 2024)Towards Uniform Online Spherical Tessellations., and . Discret. Comput. Geom., 67 (4): 1124-1146 (2022)On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond., , and . MFCS, volume 138 of LIPIcs, page 83:1-83:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)