Combinatorial Proofs of Concentration Bounds

preview_player
Показать описание
Thomas Holenstein, ETH Zürich
Information Theory in Complexity Theory and Combinatorics
  1. Simons Institute
  2. Simons Institute
  3. UC Berkeley
  4. computer science
  5. theory of computing
  6. Information Theory
Рекомендации по теме
Combinatorial Proofs of 0:31:31

Combinatorial Proofs of Concentration Bounds

Combinatorial Proof Method.mov 0:10:52

Combinatorial Proof Method.mov

Discrete Math - 0:28:07

Discrete Math - Intro to Combinatorial Proofs

Mantel's Theorem. MATH 0:18:00

Mantel's Theorem. MATH 492/529 Extremal Combinatorics, University of Victoria.

Strong Bounds for 1:04:48

Strong Bounds for 3-Progressions

[CPP'24] Formal Probabilistic 0:32:11

[CPP'24] Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local ...

AGT: Combinatorial Nullstellensatz 0:51:47

AGT: Combinatorial Nullstellensatz and the Erdős box problem

Concentration Bounds 0:24:34

Concentration Bounds

Proof of the 1:07:08

Proof of the Regularity Lemma. MATH 492/529 Extremal Combinatorics, University of Victoria.

Basic Lower Bounds 0:54:14

Basic Lower Bounds and Kneser's Theorem by David Grynkiewicz

Karim Adiprasito - 1:02:57

Karim Adiprasito - Combinatorial approaches to Hodge and Lefschetz theory

Certifying Combinatorial Solving 1:04:35

Certifying Combinatorial Solving Using Cutting Planes with Strengthening Rules

Superlinear Lower Bounds 0:34:41

Superlinear Lower Bounds for Multipass Graph Processing

Why is 4-color 0:17:27

Why is 4-color theorem easier on a torus?

19. Roth's theorem 1:20:09

19. Roth's theorem II: Fourier analytic proof in the integers

Introduction to Continuous 2:11:45

Introduction to Continuous Combinatorics I: the semidefinite method of flag... - Leonardo Coregliano

Linear Programming & 0:58:25

Linear Programming & Combinatorial Optimization (2022) Lecture-49

Ali K. Uncu 0:50:27

Ali K. Uncu - 1/5 - Generating Functions for Partitions from a Combinatorial Point of View

L01 02 Introduction 0:26:42

L01 02 Introduction to Machine Learning and Combinatorial Proof of Curse of dimensionality

06-b LFD: Heavy 0:37:45

06-b LFD: Heavy combinatorics in learning. Bounding the combinatorial quantity B(N,k).

Propositional Proof Complexity: 0:47:13

Propositional Proof Complexity: Fifteen (or so) Years After - Alexander Razborov

25. Structure of 1:14:46

25. Structure of set addition V: additive energy and Balog-Szemerédi-Gowers theorem

Chernoff Bound Proof 0:06:36

Chernoff Bound Proof

SoCG 2022: Asymptotic 0:18:25

SoCG 2022: Asymptotic bounds for the combinatorial diameter of random polytopes