Pages that link to "Item:Q4229422"
From MaRDI portal
The following pages link to Products and Help Bits in Decision Trees (Q4229422):
Displaying 10 items.
- A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
- Derandomized parallel repetition theorems for free games (Q371195) (← links)
- Optimal direct sum results for deterministic and randomized decision tree complexity (Q407594) (← links)
- Improved direct product theorems for randomized query complexity (Q693002) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- Sharing one secret vs. sharing many secrets. (Q1401235) (← links)
- The value of help bits in randomized and average-case complexity (Q2012180) (← links)
- The cell probe complexity of succinct data structures (Q2373728) (← links)
- On Yao’s XOR-Lemma (Q3088189) (← links)
- (Q5091781) (← links)
