Oleg Lupanov | |
---|---|
Born | Oleg Borisovich Lupanov 2 June 1932 |
Died | 3 May 2006 | (aged 73)
Alma mater | Moscow State University |
Awards | Lenin Prize (1966) |
Scientific career | |
Fields | Discrete Mathematics, Mathematical Cybernetics and Mathematical Logic |
Institutions | Moscow State University Institute of Applied Mathematics |
Doctoral advisor | Sergey Vsevolodovich Yablonsky[1] |
Doctoral students | Bella Subbotovskaya |
Oleg Borisovich Lupanov (Russian: Оле́г Бори́сович Лупа́нов; 2 June 1932 – 3 May 2006) was a Soviet and Russian mathematician, dean of the Moscow State University's Faculty of Mechanics and Mathematics (1980–2006), head of the Chair of Discrete Mathematics of the Faculty of Mechanics and Mathematics (1981–2006).[2]
Together with his graduate school advisor, Sergey Yablonsky, he is considered one of the founders of the Soviet school of Mathematical Cybernetics. In particular he authored pioneering works on synthesis and complexity of Boolean circuits, and of control systems in general (Russian: Управляющие системы), the term used in the USSR and Russia for a generalization of finite state automata, Boolean circuits and multi-valued logic circuits.
Ingo Wegener, in his book The Complexity of Boolean Functions,[3] credits O. B. Lupanov for coining the term Shannon effect in his 1970 paper,[4] to refer to the fact that almost all Boolean functions have nearly the same circuit complexity as the hardest function.
O. B. Lupanov is best known for his (k, s)-Lupanov representation of Boolean functions[5] that he used to devise an asymptotically optimal method of Boolean circuit synthesis, thus proving the asymptotically tight upper bound on Boolean circuit complexity: