The following pages link to Yaqiao Li (Q281936):
Displaying 11 items.
- A characterization of functions with vanishing averages over products of disjoint sets (Q281937) (← links)
- Trading information complexity for error. II: The case of a large error and the external information complexity (Q2105437) (← links)
- Conflict complexity is lower bounded by block sensitivity (Q2219069) (← links)
- The winning property of mixed badly approximable numbers (Q2249167) (← links)
- Chang's lemma via Pinsker's inequality (Q2279257) (← links)
- (Q4568116) (← links)
- (Q5111146) (← links)
- Online coloring and a new type of adversary for online graph problems (Q5918632) (← links)
- Information complexity of the AND function in the two-party and multi-party settings (Q5919672) (← links)
- Online coloring and a new type of adversary for online graph problems (Q5970811) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
