The following pages link to Mikhail N. Vyalyi (Q943843):
Displaying 42 items.
- On regular realizability problems for context-free languages (Q327306) (← links)
- On regular realizability problems (Q375967) (← links)
- (Q444439) (redirect page) (← links)
- Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs (Q444440) (← links)
- Semidefinite programming and arithmetic circuit evaluation (Q943844) (← links)
- (Q1425852) (redirect page) (← links)
- On the stability of the Voronoi diagram. (Q1425853) (← links)
- Lower estimate for the cardinality of the domain of universal functions for the class of linear Boolean functions (Q1744294) (← links)
- Counting the number of perfect matchings, and generalized decision trees (Q2044128) (← links)
- Automata equipped with auxiliary data structures and regular realizability problems (Q2096592) (← links)
- Geometry of translations on a Boolean cube (Q2190912) (← links)
- On expressive power of regular realizability problems (Q2262977) (← links)
- Efficient algorithms for sparse cyclotomic integer zero testing (Q2268346) (← links)
- Fast protocols for leader election and spanning tree construction in a distributed network (Q2285076) (← links)
- Distributed communication complexity of spanning tree construction (Q2355664) (← links)
- On the linear classification of even and odd permutation matrices and the complexity of computing the permanent (Q2359079) (← links)
- Orbits of Linear Maps and Regular Languages (Q3007635) (← links)
- (Q3115238) (← links)
- On Models of a Nondeterministic Computation (Q3392968) (← links)
- An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity (Q3499789) (← links)
- Identical Relations in Symmetric Groups and Separating Words with Reversible Automata (Q3569739) (← links)
- (Q3980662) (← links)
- (Q4406630) (← links)
- (Q4544834) (← links)
- Gr\"unbaum coloring and its generalization to arbitrary dimension (Q4595177) (← links)
- (Q4635461) (← links)
- Universality of Regular Realizability Problems (Q4928492) (← links)
- Computational Hardness of Multidimensional Subtraction Games (Q5042244) (← links)
- A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem (Q5100142) (← links)
- Re-pairing brackets (Q5145644) (← links)
- (Q5263763) (← links)
- Separating words by occurrences of subwords (Q5264722) (← links)
- Cones of multipowers and combinatorial optimization problems (Q5413066) (← links)
- (Q5715089) (← links)
- On computational complexity of set automata (Q5918383) (← links)
- On computational complexity of set automata (Q5920130) (← links)
- Shifting paths to avoidable ones (Q6057583) (← links)
- Testing the satisfiability of algebraic formulas over the field of two elements (Q6137613) (← links)
- Growing Trees and Amoebas' Replications (Q6517368) (← links)
- Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies (Q6581883) (← links)
- Hypergraph edge representations with the use of homological paths (Q6644071) (← links)
- On universality of regular realizability problems (Q6660012) (← links)
