“…Such models can be used to capture all known rectangle-based lower bound techniques used in communication complexity. This includes widely studied measures such as corruption [Yao83,BFS86,Raz92,Kla03,BPSW06,She12a,GW16], smooth rectangle bound [JK10,Kla10,CKW12,JY12,HJ13,KMSY14], relaxed partition bound [KLL + 15], and extended discrepancy [Kla03,GL14]; see [JK10] for an extensive catalog. The Simulation Theorem applies to all these measures: it reduces the task of understanding a specific communication complexity measure of f • g n to the task of understanding a corresponding query complexity measure of f , which is typically a far easier task.…”