Computational Complexity Theorists

Welcome, fellow nerds! This is the meeting of the Computational Complexity Theorists, where we discuss the intricacies of NP-completeness and the beauty of exponential growth.

See our friends from the Algorithmic Geeks group Visit the Complexity Solvers for more brain teasers

Subgroups:

• Algorithmic Solvers
• Complexity Busters
• Efficient Optimizers
• Teaser Experts

Today's Agenda:

9:00 AM - 9:30 AM: Coffee and Complexity

- 9:30 AM - 10:30 AM: NP-Completeness 101 with Dr. Smith

- 10:30 AM - 11:00 AM: Break

11:00 AM - 12:00 PM: Exponential Growth and its Consequences with Dr. Lee