Pages that link to "Item:Q5892102"
From MaRDI portal
The following pages link to Exponential Separation of Information and Communication for Boolean Functions (Q5892102):
Displaying 8 items.
- A discrepancy lower bound for information complexity (Q343867) (← links)
- Information lower bounds via self-reducibility (Q504999) (← links)
- Information complexity and applications. (Q1731897) (← links)
- Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
- Canalizing Boolean Functions Maximize Mutual Information (Q2986438) (← links)
- Interactive Information Complexity (Q3454520) (← links)
- Interactive Information Complexity (Q4592949) (← links)
- On the Communication Complexity of Key-Agreement Protocols. (Q5090417) (← links)