Algorithms and Complexity
Computer science theory assesses which problems are possible and feasible to solve through theories of computability, undecidability, complexity, reducibility, and approximability.
Research in algorithms involves the best ways to formulate computational tasks as well as solve them in various serial, parallel, streaming, and distributed environments.
Besides raising famous open questions surrounding P, NP, and other complexity classes, the field has demonstrated the interrelatedness of myriad, diverse computational problems, the promise of quantum computing, the quantification of information, knowledge, and security, and the success of algorithmic methods in computational learning and data science.
