Risultati della ricerca - Tan, Li-Yang

Superconstant Inapproximability of Decision Tree Learning di Koch, Caleb, Strassle, Carmen, Tan, Li-Yang

Testo

Fast decision tree learning solves hard coding-theoretic problems di Koch, Caleb, Strassle, Carmen, Tan, Li-Yang

Testo

A Strong Direct Sum Theorem for Distributional Query Complexity di Blanc, Guy, Koch, Caleb, Strassle, Carmen, Tan, Li-Yang

Testo

The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem di Blanc, Guy, Hayderi, Alexandre, Koch, Caleb, Tan, Li-Yang

Testo

A Distributional-Lifting Theorem for PAC Learning di Blanc, Guy, Lange, Jane, Strassle, Carmen, Tan, Li-Yang

Testo

Computational-Statistical Tradeoffs from NP-hardness di Blanc, Guy, Koch, Caleb, Strassle, Carmen, Tan, Li-Yang

Testo

The power of quantum circuits in sampling di Blanc, Guy, Koch, Caleb, Lange, Jane, Strassle, Carmen, Tan, Li-Yang

Testo

Samplability makes learning easier di Blanc, Guy, Koch, Caleb, Lange, Jane, Strassle, Carmen, Tan, Li-Yang

Testo