Free Courses
    В каталог

    Theoretical Computer Science

    513 курсов
    Computability
    Formal Languages
    Minsky Machines
    Turing Machines
    Junta Correlation Is Testable
    IEEE

    Junta Correlation Is Testable

    Optimization of the Sherrington-Kirkpatrick Hamiltonian
    IEEE

    Optimization of the Sherrington-Kirkpatrick Hamiltonian

    Why Are Proof Complexity Lower Bounds Hard?
    IEEE

    Why Are Proof Complexity Lower Bounds Hard?

    An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature
    IEEE

    An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature

    Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
    IEEE

    Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model

    Towards a Proof of the Fourier Entropy Conjecture
    IEEE

    Towards a Proof of the Fourier Entropy Conjecture

    Indistinguishability Obfuscation from Well Founded Assumptions - Part 1
    IEEE

    Indistinguishability Obfuscation from Well Founded Assumptions - Part 1

    Independent Set on P_k-Free Graphs in Quasi-Polynomial Time
    IEEE

    Independent Set on P_k-Free Graphs in Quasi-Polynomial Time

    On Light Spanners, Low-Treewidth Embeddings and Efficient Traversing in Minor-Free Graphs
    IEEE

    On Light Spanners, Low-Treewidth Embeddings and Efficient Traversing in Minor-Free Graphs

    Hypergraph K-Cut for Fixed K in Deterministic Polynomial Time
    IEEE

    Hypergraph K-Cut for Fixed K in Deterministic Polynomial Time

    Rigid Matrices from Rectangular PCPs
    IEEE

    Rigid Matrices from Rectangular PCPs

    Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes
    IEEE

    Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes

    Local Proofs Approaching the Witness Length
    IEEE

    Local Proofs Approaching the Witness Length

    New Techniques for Proving Fine-Grained Average-Case Hardness
    IEEE

    New Techniques for Proving Fine-Grained Average-Case Hardness

    Is it Easier to Prove Statements that are Guaranteed to be True?
    IEEE

    Is it Easier to Prove Statements that are Guaranteed to be True?

    Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs
    IEEE

    Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs

    Fully-Dynamic Submodular Cover with Bounded Recourse
    IEEE

    Fully-Dynamic Submodular Cover with Bounded Recourse

    List Decodable Mean Estimation in Nearly Linear Time
    IEEE

    List Decodable Mean Estimation in Nearly Linear Time

    Nearly Optimal Pseudorandomness From Hardness
    IEEE

    Nearly Optimal Pseudorandomness From Hardness

    Framework for Existential Real-Completeness of Two-Dimensional Packing Problems
    IEEE

    Framework for Existential Real-Completeness of Two-Dimensional Packing Problems

    Smoothing the Gap Between NP and ER
    IEEE

    Smoothing the Gap Between NP and ER