YoVDO

Big O and Friends - Lecture 2a of CS Theory Toolkit

Offered By: Ryan O'Donnell via YouTube

Tags

Big O Notation Courses Mathematics Courses Asymptotic Analysis Courses Theoretical Computer Science Courses

Course Description

Overview

Explore the fundamental concepts of asymptotic notation in this graduate-level lecture from Carnegie Mellon University's "CS Theory Toolkit" course. Delve into Big O, Little O, Big Omega, Little Omega, poly(), O-tilde, and standard form functions. Learn from Professor Ryan O'Donnell as he covers essential math and computer science fundamentals for research in theoretical computer science. Gain insights from recommended resources such as "Asymptopia" by Joel Spencer, "Concrete Mathematics" by Graham-Knuth-Patashnik, and "Asymptotic Methods in Analysis" by Dick de Bruijn. Access additional course materials through CMU's Diderot system for a comprehensive understanding of these crucial concepts in computer science theory.

Syllabus

Introduction
Little O
Twiddle
Omega twiddle
Examples


Taught by

Ryan O'Donnell

Related Courses

Algorithmic Thinking (Part 1)
Rice University via Coursera Algorithmic Thinking (Part 2)
Rice University via Coursera Data Structures and Performance
University of California, San Diego via Coursera Calculus: Single Variable Part 1 - Functions
University of Pennsylvania via Coursera Calculus: Single Variable Part 3 - Integration
University of Pennsylvania via Coursera