🍿 Enumeration of 2-level polytopes
Computer-Assisted Resolution of the Direct Product Conjecture via Kullback-Leibler (KL) Divergence Information Tensorization and Pinsker-Bounded Simulation Operators. (Cloud Security)
This is the GitHub page associated to the manuscript "Algebra of Nonlocal Boxes and the Collapse of Communication Complexity".
Exhaustive search for hard instances of bipartite matching in the one-way two-party communication model
Mini research lab for 3-player Number-on-Forehead Exactly-N: corner-free sets from Behrend-style construction, certificate verification, parameter sweeps, and reproducible outputs.
Restricted-column theorems for the HLS two-level log-rank formulation: sharp 2/5 two-point escape, logarithmic communication on Johnson products and sparse columns. Does not prove general Log-Rank. Paper, Lean core, and verification scripts.
Exponentially compress a classical string into a quantum fingerprint that enables equality testing.
To associate your repository with the communication-complexity topic, visit your repo's landing page and select "manage topics."