Mathematics & Computer Science
NSF-CBMS Conference on Algorithms and Complexity
Explore This Section
Major and Minor Requirements
- Mathematics
-
Computer Science
- Major Requirements
- Minor Requirements
- Data Science Minor Electives
- Choosing Intro Courses in CS
- Changes to Computer Science Major
- How to Declare the CS Major
- Changes to Computer Science Minor
- Distinction in CS
- Frequently Asked Questions
- Racial/Gender Ethics and Equity
- CC - AIT Budapest Equivalencies
- Mathematical Economics
Major Requirements
Minor Requirements
Data Science Minor Electives
Choosing Intro Courses in CS
Changes to Computer Science Major
How to Declare the CS Major
Changes to Computer Science Minor
Distinction in CS
Frequently Asked Questions
Racial/Gender Ethics and Equity
CC - AIT Budapest Equivalencies
In the summer of 1987, John Watkins, with help from the department, organized a conference on algorithms and complexity funded by the National Science Foundation. Twenty-seven mathematicians from around the country spent five days at the Baca Campus of the Colorado College listening to Herbert Wilf from the University of Pennsylvania outline the major results in the study of algorithm complexity.
Report an issue -
Last updated: 05/28/2024