Everyday Computational Challenges that Elude Computers


10:00-11:00 am    Add
Calvin Lab Auditorium

Puzzle-like combinatorial search problems arise throughout the sciences, engineering and the world of commerce. Often, the best methods known to solve them require astronomical amounts of computation. A fundamental question, the "P versus NP problem," asks whether these explosions in computation time are inherently unavoidable. We will discuss the implications for e-commerce, and for the efficient marshaling of society's resources.
Richard Karp, Professor
| Find more events
Copyright © 2014 UC Regents; all rights reserved.