When pigeons outnumber pigeonholes, some birds must double up. This obvious statement — and its inverse — have deep ...

Introduces the foundations of automata theory, computability theory, and complexity theory. Shows relationship between automata and formal languages. Addresses the issue of which problems can be ...

Mathematical maturity is an absolute must. Computational Complexity theory looks at the computational resources (time, memory, communication, ...) needed to solve computational problems that we care ...

https://doi.org/10.1086/426800 • https://www.jstor.org/stable/10.1086/426800 Abbott, Andrew. 2001. Chaos of Disciplines. Chicago: University of Chicago Press ...

Welcome to the website of the CS theory group at CU Boulder! Our faculty and students research all aspects of theoretical computer science, from core areas such as algorithms, complexity, and ...