Archive: Hardness Amplification by Repetition
474 views · Published 29 April 2009 · 52:34 · Indexed 20 September 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
-
53:34
Archive: Closing the Innovation Gap
-
27:18
Archive: Eastside Specialty Center: Coordination of Care
-
22:35
Archive: Innovations in Spine Care
-
58:21
Archive: Sustainable Urban Ecosystems: Physical and Biological Environments, Part 1
-
57:55
Archive: Sustainable Urban Ecosystems: Physical and Biological Environments, Part 2
-
56:54
Archive: Tribal Forestry: Part 2 - Opportunities and Challenges for Tribal Forestry
-
1:26:10
Archive: Science and Politics: The Discordant Couple in the Fight Against AIDS
-
57:47
Archive: The Promise of Prevention for Conduct Problems in At-Risk Youth, Part 2