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
Algebraic Geometry
SQL
Computer Science
Project Management: The Basics for Success
Sustainable Tourism: Society & Environmental Aspects
Introducción a los encofrados y las cimbras en obra civil y edificación
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Explore new combinatorial condition numbers for linear and integer programs, their relation to existing measures, and their impact on circuit diameter bounds and simplex methods.
Explores strategy iteration framework for parity games using universal trees, aiming to overcome quasi-polynomial barriers and improve upon value iteration algorithms for efficient game solving.
Binary scalar products: Proving a conjecture on 2-level polytopes, exploring their unique properties and demonstrating that the product of vertices and facets is bounded by d2^(d+1) for d-dimensional polytopes.
Explore tropical linear regression, its connection to mean payoff games, and applications in auction theory. Learn about equilibrium prices and quantifying market distances.
Explores separation theorems in signed tropical convexities, comparing TO and TC-convexities. Presents new results on hyperplane separation, characterizes segments and hemi-spaces, and proves equivalence for generic point collections.
Explore the geometric perspective on pivot rules in linear programming, connecting polyhedra, simplex methods, and arborescences to gain insights into optimization algorithms.
Explores steepest descent in 0/1 LPs, proving polynomial-length paths and developing a new pivot rule for the Simplex method. Unifies circuit and edge steps, advancing understanding of combinatorial optimization.
Explore parameterized complexity and its applications in discrete optimization, focusing on LP-guided techniques, Lenstra's algorithm, and structured ILPs using Graver bases.
Explore advanced approximation algorithms for network design, focusing on connectivity augmentation problems and recent developments in combinatorial optimization techniques.
Explore parameterized complexity, focusing on LP-related methods. Learn branching, color coding, kernelization, and dynamic programming techniques for algorithm design and optimization.
Explore advanced network design techniques for increasing graph connectivity, focusing on augmentation problems and recent developments in combinatorial optimization.
Explore interior point methods for optimization, their recent advancements, and applications in solving various continuous and combinatorial problems efficiently.
Gentle introduction to parameterized complexity, focusing on basic techniques like branching, color coding, and kernelization. Explores connections to linear programming and discrete optimization.
Explore recent advancements in the Bochner Riesz problem, a key topic in harmonic analysis and Fourier analysis, with insights from cutting-edge research.
Explore a unified approach to exponential sums and oscillatory integrals, delving into advanced mathematical concepts and techniques in this comprehensive lecture.
Get personalized course recommendations, track subjects and courses with reminders, and more.