Archive: Hardness Amplification by Repetition
474 views · Published 29 April 2009 · 52:34 · Indexed 15 October 2026
Channel: UW Video · 2009 · Education
Does computing k times as many functions require k times the computational effort? In this talk, we discuss a few scenarios in which variants of this question have been studied. This talk will examine hardness of approximation, communication complexity and spherical cubes. To see more videos from the University of Washington visit https://uw.edu/video. The University of Washington is committed to ensuring digital accessibility in our services, programs, and activities. If you encounter accessibility barriers using videos found on this channel, please contact UW Video at uwvideo [at] uw [dot] edu.
More from this channel
-
54:45
Archive: Usable Privacy and Security: Protecting People from Online Phishing Scams
-
58:27
Archive: Technology for Long-Term Care: Scaling Elder Care to the Next Billion
-
53:34
Archive: Closing the Innovation Gap
-
54:57
Archive: Network Coded Wireless Architecture
-
58:16
Archive: Thinking Historically about Thinking Historically: Identity Politics to Ethical Action
-
27:18
Archive: Eastside Specialty Center: Coordination of Care
-
22:35
Archive: Innovations in Spine Care
-
25:14
Archive: Regaining an Active Life