Lijie Chen
Lijie Chen
Dirección de correo verificada de mit.edu - Página principal
TítuloCitado porAño
Complexity-theoretic foundations of quantum supremacy experiments
S Aaronson, L Chen
arXiv preprint arXiv:1612.05903, 2016
952016
Nearly instance optimal sample complexity bounds for top-k arm selection
L Chen, J Li, M Qiao
arXiv preprint arXiv:1702.03605, 2017
272017
Pure exploration of multi-armed bandit under matroid constraints
L Chen, A Gupta, J Li
Conference on Learning Theory, 647-669, 2016
252016
On the power of statistical zero knowledge
A Bouland, L Chen, D Holden, J Thaler, PN Vasudevan
SIAM Journal on Computing, FOCS17-1-FOCS17-58, 2019
232019
On the hardness of approximate and exact (bichromatic) maximum inner product
L Chen
arXiv preprint arXiv:1802.02325, 2018
232018
On the optimal sample complexity for best arm identification
L Chen, J Li
arXiv preprint arXiv:1511.03774, 2015
232015
Nearly optimal sampling algorithms for combinatorial pure exploration
L Chen, A Gupta, J Li, M Qiao, R Wang
arXiv preprint arXiv:1706.01081, 2017
202017
Towards instance optimal bounds for best arm identification
L Chen, J Li, M Qiao
arXiv preprint arXiv:1608.06031, 2016
162016
An equivalence class for orthogonal vectors
L Chen, R Williams
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
142019
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
82019
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
72019
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
62019
Bounded rationality of restricted turing machines
L Chen, P Tang, R Wang
Thirty-First AAAI Conference on Artificial Intelligence, 2017
62017
Improved algorithms for maintaining DFS tree in undirected graphs
L Chen, R Duan, R Wang, H Zhang
CoRR, abs/1607.04913, 2016
6*2016
A note on oracle separations for BQP
L Chen
arXiv preprint arXiv:1605.00619, 2016
52016
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
42019
Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity
L Chen, RR Williams
34th Computational Complexity Conference (CCC 2019), 2019
42019
Classical algorithms from quantum and arthur-merlin communication protocols
L Chen, R Wang
arXiv preprint arXiv:1811.07515, 2018
42018
K-Memory Strategies in Repeated Games.
L Chen, F Lin, P Tang, K Wang, R Wang, S Wang
AAMAS, 1493-1498, 2017
42017
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
32019
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20