Artifact Details

Title

The complexity of addition

Catalog Number

102724511

Type

Moving image

Date

1987-09

Credits

Pippenger, Nicholas

Publisher

University Video Communications

Duration

00:42:00

Format

U-matic

Copyright Holder

Computer History Museum

Description

From University Video Communications' catalog:

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

Category

Lecture

Collection Title

University Video Communications lectures

Series Title

Distinguished Lecture Series : Theoretical Computer Science

Credit

Gift of University Video Communications

Lot Number

X6636.2013