Follow
Vyalyi
Title
Cited by
Cited by
Year
Classical and quantum computation
AY Kitaev, A Shen, MN Vyalyi
American Mathematical Soc., 2002
17372002
Construction of contour trees in 3D in O(n log n) steps
SP Tarasov, MN Vyalyi
Proceedings of the fourteenth annual symposium on Computational geometry, 68-75, 1998
1381998
Commutative version of the k-local Hamiltonian problem and common eigenspace problem
S Bravyi, M Vyalyi
arXiv preprint quant-ph/0308021, 2003
912003
Qma= pp implies that pp contains ph
M Vyalyi
ECCCTR: Electronic Colloquium on Computational Complexity, technical reports, 2003
532003
Characterizing (quasi-) ultrametric finite spaces in terms of (directed) graphs
V Gurvich, M Vyalyi
Discrete Applied Mathematics 160 (12), 1742-1756, 2012
442012
Classical and quantum computing
G Jaeger
Quantum Information: An Overview, 203-217, 2007
342007
Semidefinite programming and arithmetic circuit evaluation
SP Tarasov, MN Vyalyi
Discrete Applied Mathematics 156 (11), 2070-2078, 2008
212008
Orbits of linear maps and regular languages
S Tarasov, M Vyalyi
International Computer Science Symposium in Russia, 305-316, 2011
182011
Klassicheskie i kvantovye vychisleniia
AY Kitaev, A Shen, MN Vyalyi
MTsNMO-CheRo, 1999
141999
On regular realizability problems
MN Vyalyi
Problems of Information Transmission 47 (4), 342-352, 2011
132011
The stability of the Voronoi diagram
MN Vyalyi, EN Gordeyev, SP Tarasov
Computational mathematics and mathematical physics 3 (36), 405-414, 1996
121996
On models of a nondeterministic computation
MN Vyalyi
Computer Science-Theory and Applications: Fourth International Computer …, 2009
112009
Нижняя оценка мощности области определения универсальных функций для класса линейных булевых функций
АА Вороненко, МН Вялый
Дискретная математика 28 (4), 50-57, 2016
10*2016
Efficient algorithms for sparse cyclotomic integer zero testing
Q Cheng, SP Tarasov, MN Vyalyi
Theory of Computing Systems 46 (1), 120-142, 2010
102010
Regular realizability problems and context-free languages
A Rubtsov, M Vyalyi
International Workshop on Descriptional Complexity of Formal Systems, 256-267, 2015
92015
Ultrametrics, trees, and bottleneck arcs
V Gurvich, M Vyalyi
Math. Ed., Moscow: MCNMO 3 (16), 75-88, 2012
92012
Classical and Quantum Computation (Graduate Studies in Mathematics vol 47)(Providence, RI: American Mathematical Society)
AY Kitaev, AH Shen, MN Vyalyi
92002
Gr\" unbaum coloring and its generalization to arbitrary dimension
S Lawrencenko, MN Vyalyi, LV Zgonnik
arXiv preprint arXiv:1607.03959, 2016
82016
On expressive power of regular realizability problems
MN Vyalyi
Problems of Information Transmission 49 (3), 276-291, 2013
72013
Identical relations in symmetric groups and separating words with reversible automata
RA Gimadeev, MN Vyalyi
International Computer Science Symposium in Russia, 144-155, 2010
72010
The system can't perform the operation now. Try again later.
Articles 1–20