Courses from 1000+ universities
17 years ago, Krishna Kumar started offering free PMP prep online. Today, it’s a leading digital upskilling platform that helps millions upskill in AI, cybersecurity, data science, and more.
600 Free Google Certifications
Management
Cybersecurity
Artificial Intelligence
Comprendere la filosofia
Introduction to Engineering Mechanics
Mathematical Economics
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Explore advanced cutting plane methods for convex optimization and games, covering improved algorithms, runtime bottlenecks, data structures, and practical applications in computational mathematics.
Explore efficient algorithms for learning mixtures of linear regressions using Fourier moments, overcoming previous barriers and achieving subexponential time complexity.
Explore efficient algorithms for stochastic matching, focusing on (1-epsilon) approximation with limited queries. Learn about vertex independent matchings and local algorithms.
Explore network reliability estimation, including a novel quadratic-time approach, phase transitions, and unbiased estimators for efficient analysis of complex networks.
Explore cutting-edge research on computational complexity, focusing on sharp threshold results, hardness magnification, and probabilistic formulas in this advanced theoretical computer science talk.
Explore quantum computing depth, its implications for quantum supremacy claims, and the challenges in designing oracle problems for quantum circuits.
Explore adaptive complexity in submodular maximization, covering nonmonotone approximation and hardness. Gain insights into this advanced computational topic through a concise presentation of key concepts and findings.
Explore algorithms and lower bounds for estimating normalizing constants in log-concave distributions, covering annealing, Monte Carlo methods, and Langevin dynamics.
Explore polar codes for efficient data transmission, examining their convergence to channel capacity and applications in binary-input discrete symmetric memoryless channels.
Explore entanglement entropy in 2D frustration-free spin systems, examining Hastings' proof, robust polynomials, and the Whole Screen Directivity Lemma.
Learn about reducing Path TSP to TSP, exploring canonical ideas, large distances, special cases, and practical examples in this concise algorithmic exploration.
Explores optimal time and space complexity for leader election in population protocols, presenting a novel algorithm achieving O(n log n) interactions with Θ(log log n) states per agent.
Explore the power of quantum depth in computation, examining conjectures, hybrid systems, and key results through an oracle-based approach and simulation algorithms.
Explore efficient caching strategies using time windows, including weighted caching algorithms and technical challenges in optimizing cache performance.
Explore autonomous manipulator solutions for mobile robotics, focusing on challenges in remote environments, machine perception, and object interaction. Learn about building blocks for advanced robotic control and human-robot collaboration.
Get personalized course recommendations, track subjects and courses with reminders, and more.