Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Mikhail N. Vyalyi
Michael N. Vyalyi
2010 – today
- 2013
[c7]- 2012
[i7]- 2011
[c6]Sergey P. Tarasov, Mikhail N. Vyalyi: Orbits of Linear Maps and Regular Languages. CSR 2011: 305-316- 2010
[j2]Qi Cheng, Sergey P. Tarasov, Mikhail N. Vyalyi: Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing. Theory Comput. Syst. 46(1): 120-142 (2010)
[c5]R. A. Gimadeev, Mikhail N. Vyalyi: Identical Relations in Symmetric Groups and Separating Words with Reversible Automata. CSR 2010: 144-155
[i6]Sergey P. Tarasov, Mikhail N. Vyalyi: Orbits of linear maps and regular languages. CoRR abs/1011.1842 (2010)
2000 – 2009
- 2009
[c4]- 2008
[j1]Sergey P. Tarasov, Mikhail N. Vyalyi: Semidefinite programming and arithmetic circuit evaluation. Discrete Applied Mathematics 156(11): 2070-2078 (2008)
[i5]- 2007
[c3]Sergey P. Tarasov, Mikhail N. Vyalyi: An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity. CSR 2007: 397-406- 2005
[i4]Sergey P. Tarasov, Mikhail N. Vyalyi: Semidefinite programming and arithmetic circuit evaluation. CoRR abs/cs/0512035 (2005)- 2003
[i3]Michael N. Vyalyi: Hardness of approximating the weight enumerator of a binary linear code. CoRR cs.CC/0304044 (2003)
[i2]Mikhail N. Vyalyi: QMA=PP implies that PP contains PH. Electronic Colloquium on Computational Complexity (ECCC) 10(021) (2003)- 2001
[i1]Michael N. Vyalyi: A comparison of Zeroes and Ones of a Boolean Polynomial. CoRR cs.CC/0111052 (2001)
1990 – 1999
- 1998
[c2]Sergey P. Tarasov, Michael N. Vyalyi: Construction of Contour Trees in 3D in O(n log n) Steps. Symposium on Computational Geometry 1998: 68-75- 1997
[c1]Sergey P. Tarasov, Michael N. Vyalyi: Some PL Functions on Surfaces are not Height Functions. Symposium on Computational Geometry 1997: 113-118
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-05 21:25 CEST by the dblp team



