Richard J. Lipton

Richard Jay Lipton ( born September 6, 1946) is an American computer scientist ( Theoretical computer science, cryptology, DNA computers).

Lipton graduated from Case Western Reserve University with a bachelor's degree in 1968 and was established in 1973 with David Parnas at Carnegie Mellon University PhD (On Synchronization Primitive system ). He then taught at Yale University, from 1978 at the University of California, Berkeley, from 1980 to 2000 at Princeton University, and from 2000 at the Georgia Institute of Technology.

It dealt, inter alia, verification of utilities, security of databases, parallel algorithms, game theory, multi-party communication protocols and theoretically with DNA computing, where it applies to Leonard Adleman as one of the pioneers. He showed that DNA computers can solve some difficult computational problems such as the SAT problem for Boolean circuits.

By Richard M. Karp in 1980 he proved the theorem of Karp and Lipton in the satisfiability of propositional logic ( SAT). He was from 1996, an advisory scientist at Telcordia ( formerly Bellcore ) and led a laboratory at Panasonic. He was Guggenheim Fellow (1981 ), is a Fellow of the Association for Computing Machinery and the National Academy of Engineering.

He has his own blog Godel 's lost letter and P = NP and published articles from 2010 as a book.

His doctoral include Avi Wigderson and Dan Boneh.

Writings

• The P = NP problem and Gödel 's Lost Letter, Springer Verlag 2010