Pages that link to "Item:Q4852622"
From MaRDI portal
The following pages link to Amortized Communication Complexity (Q4852622):
Displayed 26 items.
- Direct sum fails for zero-error average communication (Q343859) (← links)
- Certifying equality with limited interaction (Q343864) (← links)
- Partition arguments in multiparty communication complexity (Q541668) (← links)
- Bounds on tradeoffs between randomness and communication complexity (Q687507) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- Sharing one secret vs. sharing many secrets. (Q1401235) (← links)
- Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity (Q1616616) (← links)
- The choice and agreement problems of a random function (Q1705694) (← links)
- Information complexity and applications. (Q1731897) (← links)
- The direct sum of universal relations (Q1751432) (← links)
- Upper bounds on the Boolean rank of Kronecker products (Q2146742) (← links)
- Interactive Information Complexity (Q3454520) (← links)
- (Q4568116) (← links)
- (Q4577913) (← links)
- Interactive Information Complexity (Q4592949) (← links)
- Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions (Q4915250) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- Query-To-Communication Lifting for BPP Using Inner Product (Q5091185) (← links)
- (Q5091781) (← links)
- Query-to-Communication Lifting for BPP (Q5117373) (← links)
- Parallel Repetition of the Odd Cycle Game (Q5458570) (← links)
- Query-to-Communication Lifting Using Low-Discrepancy Gadgets (Q5856149) (← links)
- The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
- The communication complexity of enumeration, elimination, and selection (Q5956009) (← links)
- The communication complexity of functions with large outputs (Q6148077) (← links)
- Communication and information complexity (Q6200329) (← links)