В каталог

    Theoretical Computer Science

    513 курсов
    Algebraic Graph Theory and Quantum Computing - Lecture 4
    Fields Institute

    Algebraic Graph Theory and Quantum Computing - Lecture 4

    Algebraic Graph Theory and Quantum Computing - Lecture 3
    Fields Institute

    Algebraic Graph Theory and Quantum Computing - Lecture 3

    Algebraic Graph Theory and Quantum Computing - Lecture 14
    Fields Institute

    Algebraic Graph Theory and Quantum Computing - Lecture 14

    Algebraic Graph Theory and Quantum Computing - Lecture 2
    Fields Institute

    Algebraic Graph Theory and Quantum Computing - Lecture 2

    Algebraic Graph Theory and Quantum Computing - Lecture 24
    Fields Institute

    Algebraic Graph Theory and Quantum Computing - Lecture 24

    Algebraic Graph Theory and Quantum Computing - Lecture 20
    Fields Institute

    Algebraic Graph Theory and Quantum Computing - Lecture 20

    The Value of Errors in Proofs
    Institute for Advanced Study

    The Value of Errors in Proofs

    The Value of Errors in Proofs
    Fields Institute

    The Value of Errors in Proofs

    Computation and Formalization - Case Studies in Computational Number Theory
    Hausdorff Center for Mathematics

    Computation and Formalization - Case Studies in Computational Number Theory

    Around Cobham's Theorem
    Centre International de Rencontres Mathématiques

    Around Cobham's Theorem

    From Alan Turing to Contact Geometry: Towards a Fluid Computer
    Conference GSI

    From Alan Turing to Contact Geometry: Towards a Fluid Computer

    Formalization of Infinity Category Theory
    Schmid College, Chapman University

    Formalization of Infinity Category Theory

    Cut Sparsification and Succinct Representation of Submodular Hypergraphs
    Simons Institute for the Theory of Computing

    Cut Sparsification and Succinct Representation of Submodular Hypergraphs

    Matrix Spaces and Graphs: Connections and Applications
    Centre de recherches mathématiques - CRM

    Matrix Spaces and Graphs: Connections and Applications

    Hamiltonicity of Expanders: Optimal Bounds and Applications
    BIMSA

    Hamiltonicity of Expanders: Optimal Bounds and Applications

    Rainbow Thresholds in Graph Theory
    BIMSA

    Rainbow Thresholds in Graph Theory

    The Tale of Math and Scalability - Predicting System Performance
    GeeCON Conference

    The Tale of Math and Scalability - Predicting System Performance

    Game-Enriched Categories
    ACM SIGPLAN

    Game-Enriched Categories

    What Does Machine Learning Have to Offer Mathematics? - Theoretically Speaking
    Simons Institute

    What Does Machine Learning Have to Offer Mathematics? - Theoretically Speaking

    Black Holes and the Quantum-Extended Church-Turing Thesis - Quantum Colloquium
    Simons Institute

    Black Holes and the Quantum-Extended Church-Turing Thesis - Quantum Colloquium

    Computing Partition Functions, Part I
    Simons Institute for the Theory of Computing

    Computing Partition Functions, Part I