1:55:10 Communication Complexity Lower bound on Möbius transform (Ahmed Alharbi, tocsem #24) Bruno Loff 17 views - 5 months ago
1:59:42 Bipartite Matching is in Catalytic Logspace (TocSem #23, Ian Mertz) Bruno Loff 43 views - 5 months ago
1:53:57 The Lovasz Local Lemma (tocsem #20, Aravind Srinivasan, 2/2) Bruno Loff 64 views - 1 year ago
2:16:51 The Lovasz Local Lemma (tocsem #20, Aravind Srinivasan, 1/2) Bruno Loff 57 views - 1 year ago
2:23:25 Laver tables and Large Cardinals (tocsem #019, Luis Pereira, Part 1/2) Bruno Loff 90 views - 1 year ago
2:13:21 Laver tables and Large Cardinals (tocsem #019, Luis Pereira, Part 2/2) Bruno Loff 56 views - 1 year ago
1:19:40 The Structure of Catalytic Space: Capturing Randomness and Time via Compression Bruno Loff 184 views - 1 year ago
1:14:14 The Structure of Catalytic Space: Capturing Randomness and Time via Compression Bruno Loff 193 views - 1 year ago
2:23:37 Bisimilarity of simple grammars (ToCsem, Diogo Poças, Feb-14-2024) Bruno Loff 44 views - 2 years ago
2:50:18 Exponential Separation Between Powers of Regular and General Resolution Over Parities (1/2) Bruno Loff 76 views - 2 years ago
20:04 Exponential Separation Between Powers of Regular and General Resolution Over Parities (2/2) Bruno Loff 48 views - 2 years ago
2:58:59 On the Power of Interactive Proofs for Learning (Ninad Rajgopal, tocsem #012, March 20, 2024) Bruno Loff 133 views - 2 years ago
2:20:42 Smoothed analysis of deterministic discounted and mean-payoff games (Mateusz Skomra, part 2) Bruno Loff 43 views - 2 years ago
1:54:18 Smoothed analysis of deterministic discounted and mean-payoff games (Mateusz Skomra, part 1) Bruno Loff 55 views - 2 years ago
1:21:54 Communication Lower Bounds for Collision Problems via Density Increment Arguments Bruno Loff 108 views - 2 years ago
2:54:32 Parameterized hardness of coding and lattice problems (ToCsem, João Ribeiro, Nov-03-2023) Bruno Loff 101 views - 2 years ago
2:59:21 Improved constructions of large-dimensional corner-free sets (ToCsem, Suhail Sherif, Oct-20-2023) Bruno Loff 49 views - 2 years ago
2:22:55 The Tree Evaluation Problem: Context and Recent Results (Ian Mertz, ToC Seminar 005, Oct-12-2023) Bruno Loff 461 views - 2 years ago
3:31:24 On Switching lemmas and Criticality of Boolean formulae, pt.3/3 (ToC Seminar 002, Aug 15, 2023) Bruno Loff 36 views - 2 years ago
2:28:52 On Switching lemmas and Criticality of Boolean formulae, pt.2/3 (ToC Seminar 002, Aug 08, 2023) Bruno Loff 34 views - 2 years ago
2:57:09 On Switching lemmas and Criticality of Boolean formulae, pt.1/3 (ToC Seminar 002, Aug 04, 2023) Bruno Loff 55 views - 2 years ago
2:09:30 Communication Complexity is NP-hard (Theory of Computing Seminar 001, July 20, 2023) Bruno Loff 174 views - 2 years ago