( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Mortality for 2×2 Matrices Is NP-Hard.

, , и . MFCS, том 7464 из Lecture Notes in Computer Science, стр. 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.

Evgenij Potapov

Sergej Potapov

Evgenij Potapov

Anatolij Potapov

Igor Barabash

Das Bildzitat im Internet. Uni München, (2009)
 

Другие публикации лиц с тем же именем

Mortality for 2×2 Matrices Is NP-Hard., , и . MFCS, том 7464 из Lecture Notes in Computer Science, стр. 148-159. Springer, (2012)Reachability Problems in Low-Dimensional Iterative Maps., , и . Int. J. Found. Comput. Sci., 19 (4): 935-951 (2008)Reachability Problems in Quaternion Matrix and Rotation Semigroups., и . MFCS, том 4708 из Lecture Notes in Computer Science, стр. 346-358. Springer, (2007)Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices., , и . CoRR, (2019)Composition Problems for Braids.. FSTTCS, том 24 из LIPIcs, стр. 175-187. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Preface., и . Fundam. Informaticae, (2021)On Descriptional Complexity of the Planarity Problem for Gauss Words, , , и . CoRR, (2009)Composition problems for braids: Membership, Identity and Freeness., и . CoRR, (2017)Vector and scalar reachability problems in SL(2, Z)., и . J. Comput. Syst. Sci., (2019)Computation in One-Dimensional Piecewise Maps., , и . HSCC, том 4416 из Lecture Notes in Computer Science, стр. 706-709. Springer, (2007)