9 citations · 27 across the 4 of their papers we have counts for
4 papers
Two universal 3-quantifier representations of recursively enumerable sets
Yuri Matiyasevich, Julia Robinson
It is proved that all recursively enumerable sets of natural numbers can be represented by arithmetic formulas (of two kinds) with only 3 quantifiers.
A Criterion for Vertex Colorability of a Graph Stated in Terms of Edge Orientations
Yu. V. Matiyasevich
L.M.Vitaver [1962] and G.I.Minty [1962] suggested criteria for vertex colorability of a graph in at most a given number of colors; these criteria are stated in terms of the orienta…
Hidden Life of Riemann's Zeta Function 2. Electrons and Trains
Yuri Matiyasevich
The Riemann Hypothesis can be reformulated as statements about the eigenvalues of certain matrices whose entries are defined in terms of the Taylor coefficients of the zeta functio…
Hidden Life of Riemann's Zeta Function 1. Arrow, Bow, and Targets
Yuri Matiyasevich
The Riemann Hypothesis is reformulated as statements about eigenvalues of some matrices entries of which are defined via Taylor coefficient of the zeta function. These eigenvalues…