Lijie Chen
Title
Cited by
Cited by
Year
Complexity-theoretic foundations of quantum supremacy experiments
S Aaronson, L Chen
arXiv preprint arXiv:1612.05903, 2016
1872016
On the optimal sample complexity for best arm identification
L Chen, J Li
arXiv preprint arXiv:1511.03774, 2015
412015
Pure exploration of multi-armed bandit under matroid constraints
L Chen, A Gupta, J Li
Conference on Learning Theory, 647-669, 2016
402016
Nearly instance optimal sample complexity bounds for top-k arm selection
L Chen, J Li, M Qiao
arXiv preprint arXiv:1702.03605, 2017
392017
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
342017
On the hardness of approximate and exact (bichromatic) maximum inner product
L Chen
arXiv preprint arXiv:1802.02325, 2018
332018
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
312019
An equivalence class for orthogonal vectors
L Chen, R Williams
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
252019
Towards instance optimal bounds for best arm identification
L Chen, J Li, M Qiao
Conference on Learning Theory, 535-592, 2017
252017
Efficient construction of rigid matrices using an NP oracle
J Alman, L Chen
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
202019
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
192019
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
182019
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
132019
Non-deterministic quasi-polynomial time is average-case hard for ACC circuits
L Chen
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
132019
Relations and equivalences between circuit lower bounds and Karp-Lipton theorems
L Chen, DM McKay, CD Murray, RR Williams
34th Computational Complexity Conference (CCC 2019), 2019
132019
Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity
L Chen, RR Williams
34th Computational Complexity Conference (CCC 2019), 2019
112019
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
10*2020
Bounded rationality of restricted turing machines
L Chen, P Tang, R Wang
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
102017
Beyond natural proofs: hardness magnification and locality
L Chen, S Hirahara, IC Oliveira, J Pich, N Rajgopal, R Santhanam
arXiv preprint arXiv:1911.08297, 2019
92019
On Distributed Differential Privacy and Counting Distinct Elements
L Chen, B Ghazi, R Kumar, P Manurangsi
arXiv preprint arXiv:2009.09604, 2020
72020
The system can't perform the operation now. Try again later.
Articles 1–20