Concept

Asymptotic computational complexity

Related courses (5)

CS-459: Foundations of probabilistic proofs

Probabilistic proof systems (eg PCPs and IPs) have had a tremendous impact on theoretical computer science, as well as on real-world secure systems. They underlie delegation of computation protocols a

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a

MATH-301: Ordinary differential equations

Ce cours donne une introduction rigoureuse au principaux thèmes de la théorie des équations différentielles ordinaires (EDO). Les EDO sont fondamentales pour l'étude des systèmes dynamiques et des équ

CS-602: Foundation of probabilistic proofs

Probabilistic proof system (eg PCPs and IPs) have had a tremendous impact on the theoretical computer science, and have also found practical uses. They underlie delegation of computation protocols and

ME-608: Methods of asymptotic analysis in mechanics

The introduction to asymptotic analysis provides the basis for constructing many simplified analytical models in mechanics and for testing computations in limiting cases.