ARC Colloquium: Ryan Williams

Event Details
  • Date/Time:
    • Thursday May 13, 2010
      2:00 pm - 3:00 pm
  • Location: Klaus 1116W
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact

Elizabeth Ndongi

ndongi@cc.gatech.edu

Summaries

Summary Sentence: Improving Exhaustive Search Implies Superpolynomial Lower Bounds

Full Summary: No summary paragraph submitted.

Speaker:
Ryan Williams,  IBM Almaden Research Center

Title:
Improving Exhaustive Search Implies Superpolynomial Lower Bounds

Additional Information

In Campus Calendar
No
Groups

College of Computing, School of Computer Science

Invited Audience
No audiences were selected.
Categories
Seminar/Lecture/Colloquium
Keywords
ARC, ARC Colloquium
Status
  • Created By: Louise Russo
  • Workflow Status: Published
  • Created On: May 7, 2010 - 11:11am
  • Last Updated: Oct 7, 2016 - 9:51pm