Pages that link to "Item:Q3449568"
From MaRDI portal
The following pages link to Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications (Q3449568):
Displaying 20 items.
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- A discrepancy lower bound for information complexity (Q343867) (← links)
- Quantum conditional mutual information and approximate Markov chains (Q500059) (← links)
- Information lower bounds via self-reducibility (Q504999) (← links)
- Trading information complexity for error. II: The case of a large error and the external information complexity (Q2105437) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
- Relative Discrepancy Does not Separate Information and Communication Complexity (Q3448811) (← links)
- Interactive Information Complexity (Q3454520) (← links)
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- Interactive Information Complexity (Q4592949) (← links)
- (Q4612484) (← links)
- (Q4993274) (← links)
- Information value of two-prover games (Q4993275) (← links)
- Exponential Separation of Communication and External Information (Q4997310) (← links)
- Communication Complexity of Statistical Distance (Q5002655) (← links)
- (Q5090458) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- Query-to-Communication Lifting Using Low-Discrepancy Gadgets (Q5856149) (← links)
- Rectangles Are Nonnegative Juntas (Q5890971) (← links)
