Tubidy
    The Tree Evaluation Problem: Context and Recent Results (Ian Mertz, ToC Seminar 005, Oct-12-2023)

    The Tree Evaluation Problem: Context and Recent Results (Ian Mertz, ToC Seminar 005, Oct-12-2023)

    02:22:55 |
    Download MP3

    Related Videos

    Bruno Loff, Ciências Research Day 2023 14:16

    Bruno Loff, Ciências Research Day 2023

    Bruno Loff: Duality in Computational Complexity 33:14

    Bruno Loff: Duality in Computational Complexity

    Mini-course "Asymmetric Communication Complexity". Lecture 1 (Bruno Loff) 1:58:50

    Mini-course "Asymmetric Communication Complexity". Lecture 1 (Bruno Loff)

    Bruno Loff Live Stream 0:05

    Bruno Loff Live Stream

    Bruno Loff (University of Porto & INESC-Tec) 1:09:53

    Bruno Loff (University of Porto & INESC-Tec)

    TCS Lab seminar, HSE, Bruno Loff, NP-Hardness of Circuit Minimization for Multi-Output Functions 2:00:52

    TCS Lab seminar, HSE, Bruno Loff, NP-Hardness of Circuit Minimization for Multi-Output Functions

    Mini-course "Asymmetric Communication Complexity". Lecture 2 (Bruno Loff) 1:22:22

    Mini-course "Asymmetric Communication Complexity". Lecture 2 (Bruno Loff)

    Communication Lower Bounds for Collision Problems via Density Increment Arguments 1:21:54

    Communication Lower Bounds for Collision Problems via Density Increment Arguments

    Cobalt: bruno.loff and Teams Medic --- 15 Jun 2016 9:28

    Cobalt: bruno.loff and Teams Medic --- 15 Jun 2016

    Cobalt: roll-jump-hold etc in dune sanctuary 0:05

    Cobalt: roll-jump-hold etc in dune sanctuary

    Computing on a Full Memory 23:33

    Computing on a Full Memory

    Quantum lower bounds based on hardness of the 3SUM problem - TQC 2021 30:36

    Quantum lower bounds based on hardness of the 3SUM problem - TQC 2021

    Share 0:31

    Share

    Cobalt: roll-jump-hold in desert 0:04

    Cobalt: roll-jump-hold in desert

    On Switching lemmas and Criticality of Boolean formulae, pt.1/3 (ToC Seminar 002, Aug 04, 2023) 2:57:09

    On Switching lemmas and Criticality of Boolean formulae, pt.1/3 (ToC Seminar 002, Aug 04, 2023)

    On Switching lemmas and Criticality of Boolean formulae, pt.2/3 (ToC Seminar 002, Aug 08, 2023) 2:28:52

    On Switching lemmas and Criticality of Boolean formulae, pt.2/3 (ToC Seminar 002, Aug 08, 2023)

    On Switching lemmas and Criticality of Boolean formulae, pt.3/3 (ToC Seminar 002, Aug 15, 2023) 3:31:24

    On Switching lemmas and Criticality of Boolean formulae, pt.3/3 (ToC Seminar 002, Aug 15, 2023)

    Smoothed analysis of deterministic discounted and mean-payoff games (Mateusz Skomra, part 1) 1:54:18

    Smoothed analysis of deterministic discounted and mean-payoff games (Mateusz Skomra, part 1)

    Communication Complexity is NP-hard (Theory of Computing Seminar 001, July 20, 2023) 2:09:30

    Communication Complexity is NP-hard (Theory of Computing Seminar 001, July 20, 2023)

    The Tree Evaluation Problem: Context and Recent Results (Ian Mertz, ToC Seminar 005, Oct-12-2023) 2:22:55

    The Tree Evaluation Problem: Context and Recent Results (Ian Mertz, ToC Seminar 005, Oct-12-2023)