Yuri Petrovich Ofman (Russian: Ю́рий Петро́вич Офман) is a Russian mathematician who works in computational complexity theory.
He obtained his Doctorate from Moscow State University, where he was advised by Andrey Kolmogorov. He is the co-author with A. A. Karatsuba of one of the most important papers in computational complexity theory, which showed that it is possible to multiply two n-digit numbers by an algorithm that uses less than Ω(n2) elementary operations.
He also did important early work on parallel algorithms for prefix sums and their application in the design of Boolean circuits for addition.
Read more about Yuri Petrovich Ofman: Publications
Other articles related to "yuri petrovich ofman":
... "О приближенной реализации непрерывных функций на автоматах" ... Doklady Akademii Nauk SSSR 152 (4) 823–826 ...
Famous quotes containing the word petrovich:
“I do wish that as long as they are translating the thing, they would go right on ahead, while theyre at it, and translate Fedor Vasilyevich Protosov and Georgei Dmitrievich Abreskov and Ivan Petrovich Alexandrov into Joe and Harry and Fred.”
—Dorothy Parker (18931967)