arXiv subjects

M. N. Vyalyi

Publications and source records attributed to M. N. Vyalyi.

5 recordsLinked to original sources

arXiv2016

Grünbaum coloring and its generalization to arbitrary dimension

This paper is a collection of thoughts and observations, being partly a review and partly a report of current research, on recent work in various aspects of Grünbaum colorings, their existence and usage. In particular, one of the most striking significances of Grünbaum's Conjecture in the 2-dimensional case is its equivalence to the 4-Color Theorem. The notion of Grünbaum coloring is extended from the 2-dimensional case to the case of arbitrary finite hyper-dimensions.

math.CO↗

arXiv2016

Distributed protocols for spanning tree construction and leader election

We present fast deterministic distributed protocols in synchronous networks for leader election and spanning tree construction. The protocols are designed under the assumption that nodes in a network have identifiers but the size of an identifier is unlimited. So time bounds of protocols depend on the sizes of identifiers. We present fast protocols running in time $O(D\log L+L)$, where $L$ is the size of the minimal identifier and $D$ is the diameter of a network.

cs.DC↗

arXiv2008

On models of a nondeterministic computation

In this paper we consider a nondeterministic computation by deterministic multi-head 2-way automata having a read-only access to an auxiliary memory. The memory contains additional data (a guess) and computation is successful iff it is successful for some memory content. Also we consider the case of restricted guesses in which a guess should satisfy some constraint. We show that the standard complexity classes such as L, NL, P, NP, PSPACE can be characterized in terms of these models of nondeterministic computation. These characterizations differ from the well-known ones by absence of alternation.

cs.CC↗

arXiv2003

Hardness of approximating the weight enumerator of a binary linear code

We consider the problem of evaluation of the weight enumerator of a binary linear code. We show that the exact evaluation is hard for polynomial hierarchy. More exactly, if WE is an oracle answering the solution of the evaluation problem then P^WE=P^GapP. Also we consider the approximative evaluation of the weight enumerator. In the case of approximation with additive accuracy $2^{αn}$, $α$ is constant the problem is hard in the above sense. We also prove that approximate evaluation at a single point $e^{πi/4}$ is hard for $0<\al<\al_0\approx0.88$.

cs.CC↗

arXiv2001

A comparison of Zeroes and Ones of a Boolean Polynomial

In this paper we consider the computational complexity of the following problem. Let $f$ be a Boolean polynomial. What value of $f$, 0 or 1, is taken more frequently? The problem is solved in polynomial time for polynomials of degrees 1,2. The next case of degree 3 appears to be PP-complete under polynomial reductions in the class of promise problems. The proof is based on techniques of quantum computation.

cs.CC↗