Compare Algorithm Complexity Given The Execution Time as a Function
This video explains how to use a limit at infinity to compare the complexity (growth rate) of two functions. http://mathispower4u.com
From playlist Additional Topics: Generating Functions and Intro to Number Theory (Discrete Math)
Proof - The Chain Rule of Differentiation
This video proves the chain rule of differentiation. http://mathispower4u.com
From playlist Calculus Proofs
Determine Time Complexity Function and Time Complexity Using Big-O Notation: f(n)=(cn(n-1))/2
This video explains how to determine the time complexity of given code. http://mathispower4u.com
From playlist Additional Topics: Generating Functions and Intro to Number Theory (Discrete Math)
Big O Notation: A Few Examples
This video is about Big O Notation: A Few Examples Time complexity is commonly estimated by counting the number of elementary operations (elementary operation = an operation that takes a fixed amount of time to preform) performed in the algorithm. Time complexity is classified by the nat
From playlist Computer Science and Software Engineering Theory with Briana
Determine a Time Complexity of Code Using Big-O Notation: O(1), O(n), O(n^2)
This video explains how to determine the time complexity of given code. http://mathispower4u.com
From playlist Additional Topics: Generating Functions and Intro to Number Theory (Discrete Math)
Determine a Time Complexity of Code Using Big-O Notation: O(n+m), O(n*m), O(log(n))
This video explains how to determine the time complexity of given code. http://mathispower4u.com
From playlist Additional Topics: Generating Functions and Intro to Number Theory (Discrete Math)
Rank the Complexity of Functions
This video shows to to rank function from fastest growing to slowest growing. http://mathispower4u.com
From playlist Additional Topics: Generating Functions and Intro to Number Theory (Discrete Math)
An exploration of the Hierarchy of Operations for the SoME1 competition by 3Blue1Brown.
From playlist Summer of Math Exposition Youtube Videos
An average-case depth hierarchy theorem for Boolean - Li-Yang Tan
Computer Science/Discrete Mathematics Seminar I Topic: An average-case depth hierarchy theorem for Boolean circuits I Speaker: Li-Yang Tan Affiliation: Toyota Technological Institute, Chicago Date: Monday, April 4 We prove an average-case depth hierarchy theorem for Boolean circuits
From playlist Mathematics
Petr Zograf - Enumeration of Grothendieck's dessins and KP hierarchy
Branched covers of the complex projective line ramified over 0,1 and infinity (Grothendieck's dessins d'enfant) of fixed genus and degree are effectively enumerated. More precisely, branched covers of a given ramification profile over infinity and given numbers of preimages
From playlist Physique mathématique des nombres de Hurwitz pour débutants
An Isoperimetric Inequality for the Hamming Cube and Integrality Gaps in Graphs - Siavosh Benabbas
Siavosh Benabbas Institute for Advanced Study November 21, 2011 In 1970s Paul Erdos asked the following question: Consider all the boolean strings of length n. Assume that one has chosen a subset S of the strings such that no two chosen strings are different in precisely n/4 (or its closes
From playlist Mathematics
MIT 18.404J Theory of Computation, Fall 2020 Instructor: Michael Sipser View the complete course: https://ocw.mit.edu/18-404JF20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP60_JNv2MmK3wkOt9syvfQWY Quickly reviewed last lecture. Finished Immerman-Szelepcsenyi theorem
From playlist MIT 18.404J Theory of Computation, Fall 2020
Hierarchy Hyperbolic Spaces (Lecture - 3) by Jason Behrstock
Geometry, Groups and Dynamics (GGD) - 2017 DATE: 06 November 2017 to 24 November 2017 VENUE: Ramanujan Lecture Hall, ICTS, Bengaluru The program focuses on geometry, dynamical systems and group actions. Topics are chosen to cover the modern aspects of these areas in which research has b
From playlist Geometry, Groups and Dynamics (GGD) - 2017
The Hierarchy of Big Functions || n^n greater than n! greater than e^n greater than n^100
►Get my favorite, free calculator app for your phone or tablet: MAPLE CALCULATOR: https://www.maplesoft.com/products/maplecalculator/download.aspx?p=TC-9857 ►Check out MAPLE LEARN for your browser to make beautiful graphs and much more: https://www.maplesoft.com/products/learn/?p=TC-9857 ►
From playlist Calculus II (Integration Methods, Series, Parametric/Polar, Vectors) **Full Course**
Nathan Klein: A (Slightly) Improved Approximation Algorithm for Metric TSP
I will describe work in which we obtain a randomized 3/2 − e approximation algorithm for metric TSP, for some e greater than 10^−36. This slightly improves over the classical 3/2 approximation algorithm due to Christodes [1976] and Serdyukov [1978]. Following the approach of Oveis Gharan,
From playlist Workshop: Approximation and Relaxation
Math 131 092816 Continuity; Continuity and Compactness
Review definition of limit. Definition of continuity at a point; remark about isolated points; connection with limits. Composition of continuous functions. Alternate characterization of continuous functions (topological definition). Continuity and compactness: continuous image of a com
From playlist Course 7: (Rudin's) Principles of Mathematical Analysis
Savitch's Theorem, Space Hierarchy
Theory of Computation 16. Savitch's Theorem, Space Hierarchy ADUni
From playlist [Shai Simonson]Theory of Computation
The moment-SOS hierarchy – Jean Lasserre – ICM2018
Control Theory and Optimization Invited Lecture 16.2 The moment-SOS hierarchy Jean Lasserre Abstract: The Moment-SOS hierarchy initially introduced in optimization in 2000, is based on the theory of the K-moment problem and its dual counterpart, polynomials that are positive on K. It tur
From playlist Control Theory and Optimization
Math 101 Introduction to Analysis 110415: Continuity (two versions)
Continuity: definition of (actually sequential continuity); examples; standard definition involving neighborhoods; examples.
From playlist Course 6: Introduction to Analysis
22. Provably Intractable Problems, Oracles
MIT 18.404J Theory of Computation, Fall 2020 Instructor: Michael Sipser View the complete course: https://ocw.mit.edu/18-404JF20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP60_JNv2MmK3wkOt9syvfQWY Quickly reviewed last lecture. Introduced exponential complexity clas
From playlist MIT 18.404J Theory of Computation, Fall 2020