32 citations · 63 across the 6 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2017
Optimal lower bounds for universal relation, and for samplers and finding duplicates in streams
Michael Kapralov, Jelani Nelson, Jakub Pachocki +3
In the communication problem (universal relation) [KRW95], Alice and Bob respectively receive with the promise that . The last player to…
cs.CC2017★ 5 cited
Optimal lower bounds for universal relation, samplers, and finding duplicates
Jelani Nelson, Jakub Pachocki, Zhengyu Wang
In the communication problem (universal relation) [KRW95], Alice and Bob respectively receive and in with the promise that . The last pla…
cs.CC2014★ 1 cited
Characterizing Propositional Proofs as Non-Commutative Formulas
Fu Li, Iddo Tzameret, Zhengyu Wang
Does every Boolean tautology have a short propositional-calculus proof? Here, a propositional calculus (i.e. Frege) proof is a proof starting from a set of axioms and deriving new…