Pages that link to "Item:Q1601024"

The following pages link to Communication complexity towards lower bounds on circuit depth (Q1601024):

Displaying 13 items.

• Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
• Toward better depth lower bounds: two results on the multiplexor relation (Q777911) (← links)
• Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity (Q1616616) (← links)
• The direct sum of universal relations (Q1751432) (← links)
• On derandomized composition of Boolean functions (Q2281253) (← links)
• Prediction from partial information and hindsight, with application to circuit lower bounds (Q2311545) (← links)
• Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation (Q2968148) (← links)
• Deterministic Communication vs. Partition Number (Q4562279) (← links)
• (Q5009544) (← links)
• Lifting Theorems for Equality (Q5090501) (← links)
• (Q5091000) (← links)
• (Q5121903) (← links)
• Query-to-Communication Lifting Using Low-Discrepancy Gadgets (Q5856149) (← links)