Here is my list (in no specific order):
(*) A proof of Ehrenfeucht's conjecture about infinite systems of equations in free groups
and semigroups by Victor Guba:
V.S.Guba "Equivalence of infinite systems of equations in free groups and semigroups to
finite subsystems", Mathematical notes of the Academy of Sciences of the USSR, September 1986, Volume 40, 3, pp 688-690.
(*) A.A.Razborov, “Lower bounds on monotone complexity of the logical permanent”, Math.
Notes USSR, 37:6 (1985), 485–493.
As Laszlo Lovasz put it in his talk "The Work of A.A.Razborov" (can be easily found on the
Internet):
In an area where any step forward seemed almost hopeless (but which was at the
same time a central area of theoretical computer science) his results meant that deep
methods could be developed and to obtain strong lower bounds for algorithms was not
impossible.
(*) Isaac Newton "The mathematical principles of natural philosophy" - in this case the (finite) length of the work does not matter, since the importance is infinite :)
No comments:
Post a Comment