( en | de | ru )

 

Disambiguation of "Vyalyi, Mikhail N."

Author of the publication

copydeleteadd this publication to your clipboard
On Computational Complexity of Set Automata.

, and . DLT, volume 10396 of Lecture Notes in Computer Science, page 332-344. Springer, (2017)

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.

n n n

Mikhail Dobrynin

Mikhail Karnevskiy

Mikhail Salzmann

Mikhail Shamonin

 

Other publications of authors with the same name

Grünbaum coloring and its generalization to arbitrary dimension., , and . CoRR, (2016)Identical Relations in Symmetric Groups and Separating Words with Reversible Automata., and . CSR, volume 6072 of Lecture Notes in Computer Science, page 144-155. Springer, (2010)On Computational Complexity of Set Automata., and . DLT, volume 10396 of Lecture Notes in Computer Science, page 332-344. Springer, (2017)Shifting paths to avoidable ones., , , and . J. Graph Theory, 100 (1): 69-83 (2022)Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies., , , and . Int. J. Game Theory, 53 (2): 449-473 (June 2024)Classical and Quantum Computation., , and . Graduate studies in mathematics American Mathematical Society, (2002)Avoidability beyond paths., , , and . CoRR, (2022)On Models of a Nondeterministic Computation.. CSR, volume 5675 of Lecture Notes in Computer Science, page 334-345. Springer, (2009)Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing., , and . Theory Comput. Syst., 46 (1): 120-142 (2010)Orbits of Linear Maps and Regular Languages., and . CSR, volume 6651 of Lecture Notes in Computer Science, page 305-316. Springer, (2011)