Sampling, flowers and communication

DOI10.4230/LIPICS.ITCS.2024.100MaRDI QIDQ6906326zbMATH OpenFDO

Authors Huacheng Yu, Wei Zhan

Publication date 4 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2024.100

zbMATH Keywords

cell probecommuncation complexityflowersampling

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A lower bound for sampling disjoint sets
• Bounded-depth circuits cannot sample good codes
• scientific article; zbMATH DE number 7250167 (Why is no real title available?)
• scientific article; zbMATH DE number 7829272 (Why is no real title available?)
• Improved bounds for the sunflower lemma
• Intersection Theorems for Systems of Sets
• Large deviation bounds for decision trees and sampling lower bounds for AC0-circuits
• Nonnegative rank vs. binary rank
• Note on sunflowers
• Quadratic Maps Are Hard to Sample
• Sampling and certifying symmetric functions
• Sampling lower bounds: Boolean average-case and permutations
• The complexity of distributions
• The maximum number of disjoint pairs in a family of subsets
• The monotone complexity of \(k\)-clique on random graphs
• The Quantum Communication Complexity of Sampling
• Time hierarchies for sampling distributions

This page was built for publication: Sampling, flowers and communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906326)