Tan, Li Yang
77750  results:
Search for persons X
?
8

Lifting Uniform Learners via Distributional Decomposition:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Blanc, Guy ; Lange, Jane ; Malik, Ali. - p. 1755-1767 , 2023
 
?
9

Properly learning decision trees with queries is NP-hard:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Koch, Caleb ; Strassle, Carmen ; Tan, Li-Yang - p. 2383-2407 , 2023
 
?
10

A strong composition theorem for junta complexity and the b..:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Blanc, Guy ; Koch, Caleb ; Strassle, Carmen. - p. 1757-1777 , 2023
 
?
11

Almost 3-Approximate Correlation Clustering in Constant Rou..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Behnezhad, Soheil ; Charikar, Moses ; Ma, Weiyun. - p. 720-731 , 2022
 
?
12

Properly learning decision trees in almost polynomial time:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Blanc, Guy ; Lange, Jane ; Qiao, Mingda. - p. 920-929 , 2022
 
?
13

Tradeoffs for small-depth Frege proofs:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
 
?
14

Fooling Polytopes:

O'Donnell, Ryan ; Servedio, Rocco A. ; Tan, Li-Yang
ACM Journal of the ACM (JACM).  69 (2022)  2 - p. 1-37 , 2022
 
?
15

The composition complexity of majority:

, In: Proceedings of the 37th Computational Complexity Conference,
 
1-15
Related subjects