VHS 1987 COMPLEXITY OF ADDITION
DISTINGUISHED LECTURE SERIES

DR.  NICHOLAS PIPPENGER

INDUSTRY LEADERS IN COMPUTER SCIENCE
UNIVERSITY VIDEO COMMUNICATIONS

ABOUT THE SERIES
Chairmen and faculty of over 50 computer science departments nominated industry scientists whose lectures they would like to have available on videotape for use in their classrooms. University Video Communications arranged industry sponsorship for these.
This is one of the 23 topics I am listing.

SPONSORED BY:  IBM Almaden Research Center
RECORDED ON 9/21/87
RUN TIME: Lecture 35 Minutes, Q&A 7 Minutes, Total 42 Minutes

ABOUT THE SPEAKER (At time of this recording)
Nicholas Pippenger, IBM Fellow, Almaden Research Center, received his PhD in electrical engineering from the Massachusetts Institute of Technology in 1967.

LECTURE SUMMARY
In this lecture, Dr. Pippenger considers from a theoretical perspective, the cost and delay of logical networks that add numbers in binary. He presents the classical results on gates with bounded fan-in, together with more recent ones on gates with unbounded fan-in.

TARGETED COURSES
Graduate and upper-division courses in theory of computation, computational complexity, and algorithms and complexity.

This is one of the 23 topics I am listing.

CONDITION: LIBRARY DISCARD, STAMPS & STICKERS. VERY GOOD. ORIGINAL HARD PLASTIC CASE WITH ORIGINAL COVER WRAP. TAPE LOOKS NEARLY UNUSED.

I am also listing other Documentary, Medical & Educational videos so please take a look.