Pages that link to "Item:Q1918946"
From MaRDI portal
The following pages link to Super-logarithmic depth lower bounds via the direct sum in communication complexity (Q1918946):
Displaying 27 items.
- An information statistics approach to data stream and communication complexity (Q598248) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- Toward better depth lower bounds: two results on the multiplexor relation (Q777911) (← links)
- New bounds on the half-duplex communication complexity (Q831813) (← 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)
- Super-logarithmic depth lower bounds via the direct sum in communication complexity (Q1918946) (← links)
- Communication complexity of approximate Nash equilibria (Q2155907) (← links)
- On derandomized composition of Boolean functions (Q2281253) (← links)
- Prediction from partial information and hindsight, with application to circuit lower bounds (Q2311545) (← links)
- Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy (Q2796207) (← links)
- Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation (Q2968148) (← links)
- Branching Programs for Tree Evaluation (Q3182923) (← links)
- The Range of Topological Effects on Communication (Q3449503) (← links)
- (Q4577913) (← links)
- (Q5009544) (← links)
- Cubic Formula Size Lower Bounds Based on Compositions with Majority (Q5090412) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- (Q5091000) (← links)
- (Q5091781) (← links)
- (Q5121903) (← links)
- (Q5743415) (← links)
- Query-to-Communication Lifting Using Low-Discrepancy Gadgets (Q5856149) (← links)
- The communication complexity of enumeration, elimination, and selection (Q5956009) (← links)
- Communication and information complexity (Q6200329) (← links)
