4 citations · 7 across the 7 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2026
Primal/Dual Method for the Grothendieck Constant
Steven Heilman, Chris Jones, Giulio Malavolta
We determine the hundredths digit of the real Grothendieck constant by proving . Furthermore, numerical heuristics suggest the estimate $K_G \approx 1.7…
cs.CC2018★ 1 cited
Quantum Lovász Local Lemma: Shearer's Bound is Tight
Kun He, Qian Li, Xiaoming Sun +1
The Lovász Local Lemma (LLL) is a very powerful tool in combinatorics and probability theory to show the possibility of avoiding all bad events under some weakly dependent conditio…
cs.CC2016★ 1 cited
A Tighter Relation between Sensitivity and Certificate Complexity
Kun He, Qian Li, Xiaoming Sun
The sensitivity conjecture which claims that the sensitivity complexity is polynomially related to block sensitivity complexity, is one of the most important and challenging proble…