Pages that link to "Item:Q626679"
From MaRDI portal
The following pages link to Lower bounds on the randomized communication complexity of read-once functions (Q626679):
Displaying 10 items.
- Randomized vs. deterministic decision tree complexity for read-once Boolean functions (Q685705) (← links)
- Bounds on tradeoffs between randomness and communication complexity (Q687507) (← links)
- On read-once threshold formulae and their randomized decision tree complexity (Q1208407) (← links)
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity (Q1351496) (← links)
- On the power of circuits with gates of low \(L_{1}\) norms. (Q1389652) (← links)
- Communication complexity with small advantage (Q2182866) (← links)
- Interactive Information Complexity (Q3454520) (← links)
- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas (Q3578302) (← links)
- Interactive Information Complexity (Q4592949) (← links)
- (Q5121897) (← links)