Path: utzoo!utgpu!news-server.csri.toronto.edu!rutgers!news.cs.indiana.edu!maytag!watdragon!watdragon.waterloo.edu!abrodnik
From: abrodnik@watdragon.waterloo.edu (Andrej Brodnik (Andy))
Newsgroups: comp.theory
Subject: Alexander Razborov
Keywords: P versus NP
Message-ID: <1990Nov25.223230.21366@watdragon.waterloo.edu>
Date: 25 Nov 90 22:32:30 GMT
Sender: abrodnik@watdragon.waterloo.edu (Andrej Brodnik (Andy))
Organization: University of Waterloo
Lines: 13

Hi there,

in the AMS Notices I read that A.Razborov got a Nevanlinna Prize for his
proof that the number of and- and or- gates required to compute certain
natural monotone Boolean functions grows faster than any polynomial in the
number of arguments. I'd like to get the reference to this proof (in English
or Russian). I am sure that there are a lot of you who read it. Can you help
me, please?

Thanx in advance

Andrej