Követés
Lijie Chen
Lijie Chen
UC Berkeley
E-mail megerősítve itt: berkeley.edu - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
Complexity-theoretic foundations of quantum supremacy experiments
S Aaronson, L Chen
32nd Computational Complexity Conference (CCC 2017), 2017
4462017
Nearly instance optimal sample complexity bounds for top-k arm selection
L Chen, J Li, M Qiao
20th International Conference on Artificial Intelligence and Statistics …, 2017
802017
Towards instance optimal bounds for best arm identification
L Chen, J Li, M Qiao
Conference on Learning Theory, 535-592, 2017
762017
On the optimal sample complexity for best arm identification
L Chen, J Li
arXiv preprint arXiv:1511.03774, 2015
742015
On the hardness of approximate and exact (bichromatic) maximum inner product
L Chen
33rd Computational Complexity Conference (CCC 2018), 2018
682018
Pure exploration of multi-armed bandit under matroid constraints
L Chen, A Gupta, J Li
Conference on Learning Theory, 647-669, 2016
672016
Nearly optimal sampling algorithms for combinatorial pure exploration
L Chen, A Gupta, J Li, M Qiao, R Wang
Conference on Learning Theory, 482-534, 2017
622017
An equivalence class for orthogonal vectors
L Chen, R Williams
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
532019
On the power of statistical zero knowledge
A Bouland, L Chen, D Holden, J Thaler, PN Vasudevan
SIAM Journal on Computing 49 (4), FOCS17-1-FOCS17-58, 2019
512019
Beyond natural proofs: Hardness magnification and locality
L Chen, S Hirahara, IC Oliveira, J Pich, N Rajgopal, R Santhanam
ACM Journal of the ACM (JACM) 69 (4), 1-49, 2022
472022
Hardness magnification for all sparse NP languages
L Chen, C Jin, RR Williams
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
432019
Bootstrapping results for threshold circuits “just beyond” known lower bounds
L Chen, R Tell
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
422019
Efficient construction of rigid matrices using an NP oracle
J Alman, L Chen
SIAM Journal on Computing, FOCS19-102-FOCS19-134, 2022
402022
Fine-grained complexity meets IP= PSPACE
L Chen, S Goldwasser, K Lyu, GN Rothblum, A Rubinstein
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
402019
Almost-everywhere circuit lower bounds from non-trivial derandomization
L Chen, X Lyu, RR Williams
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 1-12, 2020
362020
Nondeterministic Quasi-Polynomial Time is Average-Case Hard for Circuits
L Chen
SIAM Journal on Computing, FOCS19-332-FOCS19-397, 2024
332024
On distributed differential privacy and counting distinct elements
L Chen, B Ghazi, R Kumar, P Manurangsi
arXiv preprint arXiv:2009.09604, 2020
332020
Strong average-case lower bounds from non-trivial derandomization
L Chen, H Ren
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
332020
Hardness vs. randomness, revised: uniform, non-black-box, and instance-wise
L Chen, R Tell
SIAM Journal on Computing, FOCS21-323-FOCS21-392, 2024
312024
Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity
L Chen, RR Williams
34th Computational Complexity Conference (CCC 2019), 19: 1-19: 43, 2019
312019
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20