Free Courses
    В каталог

    Computational Complexity

    393 курсов
    Impossibility Results for Distributed Computing I
    Simons Institute

    Impossibility Results for Distributed Computing I

    Optimal Iterative Algorithms for Problems With Random Data
    Simons Institute

    Optimal Iterative Algorithms for Problems With Random Data

    Optimal Iterative Algorithms for Problems With Random Data
    Simons Institute

    Optimal Iterative Algorithms for Problems With Random Data

    In Search of New Algorithms Part I - Neural Networks
    Simons Institute

    In Search of New Algorithms Part I - Neural Networks

    Berkeley in the 80s - Richard Karp and the Theory of Computing
    Simons Institute for the Theory of Computing

    Berkeley in the 80s - Richard Karp and the Theory of Computing

    Computational Complexity in Theory and in Practice by Richard M. Karp
    International Centre for Theoretical Sciences

    Computational Complexity in Theory and in Practice by Richard M. Karp

    Hardness of Approximation - Part 1
    Ryan O'Donnell

    Hardness of Approximation - Part 1

    Approximation Algorithms
    Ryan O'Donnell

    Approximation Algorithms

    Pandora's Box with Correlations - Learning and Approximation
    IEEE FOCS: Foundations of Computer Science

    Pandora's Box with Correlations - Learning and Approximation

    Faster Approximate Pattern Matching: A Unified Approach
    IEEE

    Faster Approximate Pattern Matching: A Unified Approach

    Subsets and Supermajorities - Optimal Hashing-based Set Similarity Search
    IEEE

    Subsets and Supermajorities - Optimal Hashing-based Set Similarity Search

    Symmetries, Graph Properties, and Quantum Speedups
    IEEE

    Symmetries, Graph Properties, and Quantum Speedups

    Approximation Algorithms for LCS and LIS with Truly Improved Running Times
    IEEE

    Approximation Algorithms for LCS and LIS with Truly Improved Running Times

    Non-deterministic Quasi-Polynomial Time is Average-case Hard for ACC Circuits
    IEEE

    Non-deterministic Quasi-Polynomial Time is Average-case Hard for ACC Circuits

    Dynamic Approximate Shortest Paths and Beyond - Subquadratic and Worst Case Update Time
    IEEE

    Dynamic Approximate Shortest Paths and Beyond - Subquadratic and Worst Case Update Time

    General Framework for Metric Optimization Problems with Delay or Deadlines
    IEEE

    General Framework for Metric Optimization Problems with Delay or Deadlines

    Waring Rank, Parameterized and Exact Algorithms
    IEEE

    Waring Rank, Parameterized and Exact Algorithms

    Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds
    IEEE

    Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds

    Dynamic Matrix Inverse - Improved Algorithms and Matching Conditional Lower Bounds
    IEEE

    Dynamic Matrix Inverse - Improved Algorithms and Matching Conditional Lower Bounds

    Complexity and Coding Theory - Session 6A
    IEEE

    Complexity and Coding Theory - Session 6A

    Understanding Deep Learning - Challenges for Statistical Learning Theory
    IEEE

    Understanding Deep Learning - Challenges for Statistical Learning Theory