ITC Conference: P4-Free Partition and Cover Numbers & Applications

ITC Conference: P4-Free Partition and Cover Numbers & Applications

Paul G. Allen School via YouTube Direct link

Intro

1 of 21

1 of 21

Intro

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

ITC Conference: P4-Free Partition and Cover Numbers & Applications

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Distilling Shared Keys & Private Randomness
  3. 3 Application 1: Cryptographic Complexity Lower Bounds
  4. 4 Cryptographic Leakge Resilience Upper Bounds BMN17
  5. 5 Communication Complexity Computation of Boolean function () relative to the EQ-oracle
  6. 6 PA-free Bipartite Graphs: The Protagonist
  7. 7 Intuition: P4-free Bipartite Graphs
  8. 8 Flat Joint Distribution
  9. 9 Flat Distributions as Bipartite Graphs
  10. 10 Joint Distributions Needing No Genie Assistance
  11. 11 P-Graphs have no Leakage Resilience
  12. 12 Illustrative Example
  13. 13 Connection to Shared Key & Randomness Extraction
  14. 14 Existing Information-theoretic & Edge-covering Measures are Imprecise
  15. 15 Hardness of P-free Partition Number
  16. 16 Graphs with High PA-free Partition Number
  17. 17 Connection to Non-deterministic Communication Complexity
  18. 18 Hardness of P-free Cover Number
  19. 19 Graphs with High PA-free Cover Number
  20. 20 Tight Estimations
  21. 21 Conclusions

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.