Algorithmic Complexity Courses and Certifications

Microcredential

Computational Thinking using Python

1 review

Learn computational thinking and Python programming to solve real-world problems. Covers algorithms, data structures, and analytical techniques for beginners and aspiring computer scientists.

• edX
• On-Demand
• $298.00
• 2 courses

Learn how to implement and analyze important algorithms in Java.

• Codecademy
• 3 hours
• On-Demand
• Free Trial Available

Learn some common interviewing tricks and tips. Then practice some real interview questions in Java.

• Codecademy
• 1 hour
• On-Demand
• Free Trial Available

IEEE

Hardness of Coding Problems

Explore SETH hardness in coding problems, focusing on linear codes, nearest codeword problem, and minimum distance problem. Learn about reductions and key concepts in computational complexity.

• YouTube
• 22 minutes
• On-Demand
• Conference Talk

Hausdorff Center for Mathematics

Daniel Dadush- Integer Programming and the Kannan-Lovasz Conjecture

Explore advanced integer programming techniques, lattice theory, and the Kannan-Lovasz conjecture in this high-level overview of solving n-variable integer programs efficiently, with insights into recent progress and key concepts.

• YouTube
• 1 hour 1 minute
• On-Demand
• Free Online Course

Applied Algebraic Topology Network

Nathanael Cox - Effective Algorithms for Quotients of Semi-Algebraic Equivalence Relations

Explore efficient algorithms for computing quotients of semi-algebraic equivalence relations, focusing on complexity, tools, and key results in applied algebraic topology.

• YouTube
• 26 minutes
• On-Demand
• Free Online Course

Applied Algebraic Topology Network

Barbara Giunti - Average Complexity of Barcode Computation for Vietoris-Rips Filtrations

Explore algorithmic complexity of persistent homology in random Vietoris-Rips filtrations, focusing on boundary matrix fill-up and its implications for computational efficiency.

• YouTube
• 52 minutes
• On-Demand
• Free Online Course

Black Hat

The Factoring Dead - Preparing for the Cryptopocalypse

Explore cryptographic vulnerabilities, recent breakthroughs in discrete mathematics, and their impact on RSA. Learn how to prepare for potential crypto apocalypse scenarios and operate in a post-RSA world.

• YouTube
• 54 minutes
• On-Demand
• Conference Talk

Institute for Pure & Applied Mathematics (IPAM)

Stochastic Vector Methods for Extended Systems - IPAM at UCLA

Explore stochastic vector approaches for electronic structure in condensed matter systems, reducing complexity and enhancing efficiency in computational quantum mechanics.

• YouTube
• 55 minutes
• On-Demand
• Free Online Course

Devoxx

How Modern SQL Databases Come Up With Algorithms That You Would Have Never Dreamed Of

Discover how modern SQL databases outperform hand-written algorithms with cost-based optimization, enabling complex queries on large datasets to run in milliseconds. Learn why SQL is the ideal language for business logic.

• YouTube
• 47 minutes
• On-Demand
• Conference Talk

Devoxx

Functional Data Structures in Java

Explore functional data structures in Java, including persistent structures, amortized performance, and lazy evaluation. Learn efficient implementations and their advantages over JDK alternatives.

• YouTube
• 48 minutes
• On-Demand
• Conference Talk

Simons Institute

The Future of Wireless and What It Will Enable

Explore the future of wireless technology, its potential, and innovative approaches like millimeter waves, small cells, and software-defined networks to overcome current limitations.

• YouTube
• 32 minutes
• On-Demand
• Free Online Course

Ryan O'Donnell

Approximation Algorithms

Explore approximation algorithms for NP-hard problems, focusing on vertex cover, k-coverage, and traveling salesperson. Learn greedy approaches and their limitations, as well as more advanced techniques.

• YouTube
• 1 hour 14 minutes
• On-Demand
• Free Online Course

Simons Institute

Separating Quantum from Classical with K-Fold Forrelation and Friends

Explore quantum-classical separations through k-fold Forrelation, examining l1-Fourier growth and pathwise analysis to understand algorithmic differences and their broader implications in computing.

• YouTube
• 58 minutes
• On-Demand
• Free Online Course

Complexity Explorer

Graph and Tensor Algorithmic Complexity - Unit 6, Module 5

Explore algorithmic complexity in graphs and tensors, focusing on computational approaches to causality and living systems from networks to cells.

• YouTube
• 22 minutes
• On-Demand
• Free Online Course