| |
Michael N. Vyalyi
List of publications from the DBLP Bibliography Server - FAQ
| 2008 | ||
|---|---|---|
| 9 | EE | Mikhail N. Vyalyi: On models of a nondeterministic computation CoRR abs/0811.2586: (2008) |
| 8 | EE | Sergey P. Tarasov, Mikhail N. Vyalyi: Semidefinite programming and arithmetic circuit evaluation. Discrete Applied Mathematics 156(11): 2070-2078 (2008) |
| 2007 | ||
| 7 | EE | 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 | ||
| 6 | EE | Sergey P. Tarasov, Mikhail N. Vyalyi: Semidefinite programming and arithmetic circuit evaluation CoRR abs/cs/0512035: (2005) |
| 2003 | ||
| 5 | EE | Michael N. Vyalyi: Hardness of approximating the weight enumerator of a binary linear code CoRR cs.CC/0304044: (2003) |
| 4 | EE | Mikhail N. Vyalyi: QMA=PP implies that PP contains PH Electronic Colloquium on Computational Complexity (ECCC) 10(021): (2003) |
| 2001 | ||
| 3 | EE | Michael N. Vyalyi: A comparison of Zeroes and Ones of a Boolean Polynomial CoRR cs.CC/0111052: (2001) |
| 1998 | ||
| 2 | EE | 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 | ||
| 1 | EE | Sergey P. Tarasov, Michael N. Vyalyi: Some PL Functions on Surfaces are not Height Functions. Symposium on Computational Geometry 1997: 113-118 |
| 1 | Sergey P. Tarasov | [1] [2] [6] [7] [8] |