default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLijie Chen 0001
Person information
- affiliation: University of California, Berkeley, CA, USA
- affiliation (former): Massachusetts Institute of Technolog, Cambridge, MA, USA
Other persons with the same name
- Lijie Chen 0002 — China Ship Development and Design Centre, Wuhan, China
- Lijie Chen 0003 — Xiamen University, School of Aerospace Engineering, China
- Lijie Chen 0004 — State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing, China
- Lijie Chen 0005 — Changsha Institute of Technology, Department of Computer Science, China
- Lijie Chen 0006 — China Academy of Railway Sciences Limited Corporation, Standard & Metrology Research Institute, Beijing, China
- Lijie Chen 0007 — National University of Defense Technology, College of Computer, Changsha, China
- Lijie Chen 0008 — University of California Berkeley, CA, USA
- Lijie Chen 0009 — Zhejiang University of Technology, School of Computer Science and Technology, Hangzhou, China
- Lijie Chen 0010 — Fujian Agriculture and Forestry University, Fuzhou, China
Other persons with a similar name
- Li-Jie Chen — National Taiwan University, Taipei, Taiwan
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j8]Lijie Chen, Ce Jin, Rahul Santhanam, Ryan Williams:
Constructive Separations and Their Consequences. TheoretiCS 3 (2024)- [c52]Lijie Chen, Jiatu Li, Igor C. Oliveira:
Reverse Mathematics of Complexity Lower Bounds. FOCS 2024: 505-527 - [c51]Lijie Chen
, Shuichi Hirahara, Hanlin Ren:
Symmetric Exponential Time Requires Near-Maximum Circuit Size. STOC 2024: 1990-1999 - [i61]Lijie Chen, Jiatu Li, Igor C. Oliveira:
On the Unprovability of Circuit Size Bounds in Intuitionistic S12. CoRR abs/2404.11841 (2024) - [i60]Lijie Chen, Jiatu Li, Jingxun Liang:
Maximum Circuit Lower Bounds for Exponential-time Arthur Merlin. Electron. Colloquium Comput. Complex. TR24 (2024) - [i59]Lijie Chen, Jiatu Li, Igor Carboni Oliveira:
Reverse Mathematics of Complexity Lower Bounds. Electron. Colloquium Comput. Complex. TR24 (2024) - [i58]Lijie Chen, Jiatu Li, Igor Carboni Oliveira:
On the Unprovability of Circuit Size Bounds in Intuitionistic S12. Electron. Colloquium Comput. Complex. TR24 (2024) - [i57]Lijie Chen, Ron D. Rothblum, Roei Tell:
Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?). Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j7]Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, R. Ryan Williams:
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Algorithmica 85(8): 2395-2426 (2023) - [j6]Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev:
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds. J. ACM 70(4): 25:1-25:62 (2023) - [j5]Lijie Chen, Roei Tell:
Guest Column: New ways of studying the BPP = P conjecture. SIGACT News 54(2): 44-69 (2023) - [c50]Lijie Chen, Roei Tell, Ryan Williams:
Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization. FOCS 2023: 1008-1047 - [c49]Lijie Chen, William M. Hoza, Xin Lyu, Avishay Tal, Hongxun Wu:
Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. FOCS 2023: 1224-1239 - [c48]Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam:
Polynomial-Time Pseudodeterministic Construction of Primes. FOCS 2023: 1261-1270 - [c47]Lijie Chen, Xin Lyu, Avishay Tal, Hongxun Wu:
New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs. ICALP 2023: 39:1-39:20 - [c46]Lijie Chen:
New Lower Bounds and Derandomization for ACC, and a Derandomization-Centric View on the Algorithmic Method. ITCS 2023: 34:1-34:15 - [c45]Lijie Chen, Ryan Williams, Tianqi Yang:
Black-Box Constructive Proofs Are Unavoidable. ITCS 2023: 35:1-35:24 - [c44]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu:
Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. SODA 2023: 878-924 - [c43]Lijie Chen, Roei Tell:
When Arthur Has Neither Random Coins Nor Time to Spare: Superfast Derandomization of Proof Systems. STOC 2023: 60-69 - [i56]Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam:
Polynomial-Time Pseudodeterministic Construction of Primes. CoRR abs/2305.15140 (2023) - [i55]Lijie Chen, Shuichi Hirahara, Hanlin Ren:
Symmetric Exponential Time Requires Near-Maximum Circuit Size. CoRR abs/2309.12912 (2023) - [i54]Lijie Chen, William Hoza, Xin Lyu, Avishay Tal, Hongxun Wu:
Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. Electron. Colloquium Comput. Complex. TR23 (2023) - [i53]Lijie Chen, Shuichi Hirahara, Hanlin Ren:
Symmetric Exponential Time Requires Near-Maximum Circuit Size. Electron. Colloquium Comput. Complex. TR23 (2023) - [i52]Lijie Chen, Zhenjian Lu, Igor Carboni Oliveira, Hanlin Ren, Rahul Santhanam:
Polynomial-Time Pseudodeterministic Construction of Primes. Electron. Colloquium Comput. Complex. TR23 (2023) - [i51]Lijie Chen, Roei Tell, Ryan Williams:
Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization. Electron. Colloquium Comput. Complex. TR23 (2023) - [i50]Lijie Chen, Roei Tell:
New ways of studying the BPP = P conjecture. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [b1]Lijie Chen:
Better Hardness via Algorithms, and New Forms of Hardness versus Randomness. MIT, USA, 2022 - [j4]Lijie Chen, Shuichi Hirahara, Igor Carboni Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. J. ACM 69(4): 25:1-25:49 (2022) - [j3]Lijie Chen, Hanlin Ren:
Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization. SIAM J. Comput. 51(3): 20-115 (2022) - [c42]Lijie Chen, Jiatu Li, Tianqi Yang:
Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. CCC 2022: 23:1-23:37 - [c41]Lijie Chen, Ron D. Rothblum, Roei Tell:
Unstructured Hardness to Average-Case Randomness. FOCS 2022: 429-437 - [c40]Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams:
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. ITCS 2022: 3:1-3:25 - [c39]Lijie Chen, Shuichi Hirahara, Neekon Vafa:
Average-Case Hardness of NP and PH from Worst-Case Fine-Grained Assumptions. ITCS 2022: 45:1-45:16 - [c38]Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu:
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. SODA 2022: 1661-1678 - [i49]Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams:
Constructive Separations and Their Consequences. CoRR abs/2203.14379 (2022) - [i48]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu:
Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. Electron. Colloquium Comput. Complex. TR22 (2022) - [i47]Lijie Chen, Jiatu Li, Tianqi Yang:
Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. Electron. Colloquium Comput. Complex. TR22 (2022) - [i46]Lijie Chen, Ron D. Rothblum, Roei Tell:
Unstructured Hardness to Average-Case Randomness. Electron. Colloquium Comput. Complex. TR22 (2022) - [i45]Lijie Chen, Roei Tell:
When Arthur has Neither Random Coins nor Time to Spare: Superfast Derandomization of Proof Systems. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c37]Lijie Chen, Roei Tell:
Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise. FOCS 2021: 125-136 - [c36]Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams:
Constructive Separations and Their Consequences. FOCS 2021: 646-657 - [c35]Lijie Chen, Zhenjian Lu, Xin Lyu, Igor C. Oliveira:
Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹. ICALP 2021: 51:1-51:20 - [c34]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu:
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. ICALP 2021: 52:1-52:19 - [c33]Lijie Chen, Badih Ghazi, Ravi Kumar, Pasin Manurangsi:
On Distributed Differential Privacy and Counting Distinct Elements. ITCS 2021: 56:1-56:18 - [c32]Lijie Chen, Roei Tell:
Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost. STOC 2021: 283-291 - [c31]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu:
Almost optimal super-constant-pass streaming lower bounds for reachability. STOC 2021: 570-583 - [c30]Lijie Chen, Xin Lyu:
Inverse-exponential correlation bounds and extremely rigid matrices from a new derandomized XOR lemma. STOC 2021: 761-771 - [i44]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu:
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. CoRR abs/2102.11251 (2021) - [i43]Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu:
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. CoRR abs/2111.01759 (2021) - [i42]Lijie Chen, Ramis Movassagh:
Quantum Merkle Trees. CoRR abs/2112.14317 (2021) - [i41]Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams:
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - [i40]Lijie Chen, Shuichi Hirahara, Neekon Vafa:
Average-case Hardness of NP and PH from Worst-case Fine-grained Assumptions. Electron. Colloquium Comput. Complex. TR21 (2021) - [i39]Lijie Chen, Ce Jin, Rahul Santhanam, Ryan Williams:
Constructive Separations and Their Consequences. Electron. Colloquium Comput. Complex. TR21 (2021) - [i38]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu:
Almost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachability. Electron. Colloquium Comput. Complex. TR21 (2021) - [i37]Lijie Chen, Xin Lyu:
Inverse-Exponential Correlation Bounds and Extremely Rigid Matrices from a New Derandomized XOR Lemma. Electron. Colloquium Comput. Complex. TR21 (2021) - [i36]Lijie Chen, Zhenjian Lu, Xin Lyu, Igor Carboni Oliveira:
Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC1. Electron. Colloquium Comput. Complex. TR21 (2021) - [i35]Lijie Chen, Roei Tell:
Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j2]Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan:
On the Power of Statistical Zero Knowledge. SIAM J. Comput. 49(4) (2020) - [j1]Lijie Chen:
On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product. Theory Comput. 16: 1-50 (2020) - [c29]Lijie Chen, Xin Lyu, R. Ryan Williams:
Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization. FOCS 2020: 1-12 - [c28]Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev:
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract. FOCS 2020: 13-23 - [c27]Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. ITCS 2020: 70:1-70:48 - [c26]Lijie Chen, Hanlin Ren:
Strong average-case lower bounds from non-trivial derandomization. STOC 2020: 1327-1334 - [c25]Lijie Chen, Ce Jin, R. Ryan Williams:
Sharp threshold results for computational complexity. STOC 2020: 1335-1348 - [i34]Lijie Chen, Badih Ghazi, Ravi Kumar, Pasin Manurangsi:
On Distributed Differential Privacy and Counting Distinct Elements. CoRR abs/2009.09604 (2020) - [i33]Lijie Chen, Ce Jin, R. Ryan Williams:
Sharp Threshold Results for Computational Complexity. Electron. Colloquium Comput. Complex. TR20 (2020) - [i32]Lijie Chen, Xin Lyu, Ryan Williams:
Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization. Electron. Colloquium Comput. Complex. TR20 (2020) - [i31]Lijie Chen, Hanlin Ren:
Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization. Electron. Colloquium Comput. Complex. TR20 (2020) - [i30]Lijie Chen, Roei Tell:
Simple and fast derandomization from very hard functions: Eliminating randomness at almost no cost. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c24]Lijie Chen, R. Ryan Williams:
Stronger Connections Between Circuit Analysis and Circuit Lower Bounds, via PCPs of Proximity. CCC 2019: 19:1-19:43 - [c23]Lijie Chen, Dylan M. McKay, Cody D. Murray, R. Ryan Williams:
Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems. CCC 2019: 30:1-30:21 - [c22]Josh Alman, Lijie Chen:
Efficient Construction of Rigid Matrices Using an NP Oracle. FOCS 2019: 1034-1055 - [c21]Lijie Chen, Ce Jin, R. Ryan Williams:
Hardness Magnification for all Sparse NP Languages. FOCS 2019: 1240-1255 - [c20]Lijie Chen:
Non-deterministic Quasi-Polynomial Time is Average-Case Hard for ACC Circuits. FOCS 2019: 1281-1304 - [c19]Lijie Chen, Ruosong Wang:
Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols. ITCS 2019: 23:1-23:20 - [c18]Lijie Chen, Ofer Grossman:
Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators. PODC 2019: 248-255 - [c17]Lijie Chen, Shafi Goldwasser, Kaifeng Lyu, Guy N. Rothblum, Aviad Rubinstein:
Fine-grained Complexity Meets IP = PSPACE. SODA 2019: 1-20 - [c16]Lijie Chen, Ryan Williams:
An Equivalence Class for Orthogonal Vectors. SODA 2019: 21-40 - [c15]Lijie Chen, Roei Tell:
Bootstrapping results for threshold circuits "just beyond" known lower bounds. STOC 2019: 34-41 - [i29]Lijie Chen, Ofer Grossman:
Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators. CoRR abs/1905.07780 (2019) - [i28]Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. CoRR abs/1911.08297 (2019) - [i27]Lijie Chen:
Non-deterministic Quasi-Polynomial Time is Average-case Hard for ACC Circuits. Electron. Colloquium Comput. Complex. TR19 (2019) - [i26]Lijie Chen, Ofer Grossman:
Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators. Electron. Colloquium Comput. Complex. TR19 (2019) - [i25]Lijie Chen, Ce Jin, Ryan Williams:
Hardness Magnification for all Sparse NP Languages. Electron. Colloquium Comput. Complex. TR19 (2019) - [i24]Lijie Chen, Dylan M. McKay, Cody Murray, R. Ryan Williams:
Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems. Electron. Colloquium Comput. Complex. TR19 (2019) - [i23]Lijie Chen, Ron Rothblum, Roei Tell, Eylon Yogev:
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds. Electron. Colloquium Comput. Complex. TR19 (2019) - [i22]Igor Carboni Oliveira, Lijie Chen, Shuichi Hirahara, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c14]Lijie Chen:
On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product. CCC 2018: 14:1-14:45 - [c13]Lijie Chen, Ran Duan, Ruosong Wang, Hanrui Zhang, Tianyi Zhang:
An Improved Algorithm for Incremental DFS Tree in Undirected Graphs. SWAT 2018: 16:1-16:12 - [c12]Lijie Chen, Erik D. Demaine, Yuzhou Gu, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu:
Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures. SWAT 2018: 33:1-33:12 - [i21]Lijie Chen:
On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product. CoRR abs/1802.02325 (2018) - [i20]Lijie Chen, Erik D. Demaine, Yuzhou Gu, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu:
Nearly Optimal Separation Between Partially And Fully Retroactive Data Structures. CoRR abs/1804.06932 (2018) - [i19]Lijie Chen, Shafi Goldwasser, Kaifeng Lyu, Guy N. Rothblum, Aviad Rubinstein:
Fine-grained Complexity Meets IP = PSPACE. CoRR abs/1805.02351 (2018) - [i18]Lijie Chen:
Toward Super-Polynomial Size Lower Bounds for Depth-Two Threshold Circuits. CoRR abs/1805.10698 (2018) - [i17]Lijie Chen, Ruosong Wang:
Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols. CoRR abs/1811.07515 (2018) - [i16]Lijie Chen, Ryan Williams:
An Equivalence Class for Orthogonal Vectors. CoRR abs/1811.12017 (2018) - [i15]Lijie Chen:
On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product. Electron. Colloquium Comput. Complex. TR18 (2018) - [i14]Lijie Chen, Roei Tell:
Bootstrapping Results for Threshold Circuits "Just Beyond" Known Lower Bounds. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c11]Lijie Chen, Pingzhong Tang, Ruosong Wang:
Bounded Rationality of Restricted Turing Machines. AAAI 2017: 444-450 - [c10]Lijie Chen, Jian Li, Mingda Qiao:
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection. AISTATS 2017: 101-110 - [c9]Lijie Chen, Fangzhen Lin, Pingzhong Tang, Kangning Wang, Ruosong Wang, Shiheng Wang:
K-Memory Strategies in Repeated Games. AAMAS 2017: 1493-1498 - [c8]Scott Aaronson, Lijie Chen:
Complexity-Theoretic Foundations of Quantum Supremacy Experiments. CCC 2017: 22:1-22:67 - [c7]Lijie Chen, Anupam Gupta, Jian Li, Mingda Qiao, Ruosong Wang:
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration. COLT 2017: 482-534 - [c6]Lijie Chen, Jian Li, Mingda Qiao:
Towards Instance Optimal Bounds for Best Arm Identification. COLT 2017: 535-592 - [c5]Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan:
On the Power of Statistical Zero Knowledge. FOCS 2017: 708-719 - [i13]Lijie Chen, Jian Li, Mingda Qiao:
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection. CoRR abs/1702.03605 (2017) - [i12]Lijie Chen, Anupam Gupta, Jian Li, Mingda Qiao, Ruosong Wang:
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration. CoRR abs/1706.01081 (2017) - 2016
- [c4]Lijie Chen, Anupam Gupta, Jian Li:
Pure Exploration of Multi-armed Bandit Under Matroid Constraints. COLT 2016: 647-669 - [c3]Lijie Chen, Jian Li:
Open Problem: Best Arm Identification: Almost Instance-Wise Optimality and the Gap Entropy Conjecture. COLT 2016: 1643-1646 - [c2]Lijie Chen:
Adaptivity vs. Postselection, and Hardness Amplification for Polynomial Approximation. ISAAC 2016: 26:1-26:12 - [i11]Lijie Chen:
A Note on Oracle Separations for BQP. CoRR abs/1605.00619 (2016) - [i10]Lijie Chen, Anupam Gupta, Jian Li:
Pure Exploration of Multi-armed Bandit Under Matroid Constraints. CoRR abs/1605.07162 (2016) - [i9]Lijie Chen, Jian Li:
Open Problem: Best Arm Identification: Almost Instance-Wise Optimality and the Gap Entropy Conjecture. CoRR abs/1605.08481 (2016) - [i8]Lijie Chen:
Adaptivity vs Postselection. CoRR abs/1606.04016 (2016) - [i7]Lijie Chen, Ran Duan, Ruosong Wang, Hanrui Zhang:
Improved Algorithms for Maintaining DFS Tree in Undirected Graphs. CoRR abs/1607.04913 (2016) - [i6]Lijie Chen, Jian Li, Mingda Qiao:
Towards Instance Optimal Bounds for Best Arm Identification. CoRR abs/1608.06031 (2016) - [i5]Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan:
On SZK and PP. CoRR abs/1609.02888 (2016) - [i4]Scott Aaronson, Lijie Chen:
Complexity-Theoretic Foundations of Quantum Supremacy Experiments. CoRR abs/1612.05903 (2016) - [i3]Scott Aaronson, Lijie Chen:
Complexity-Theoretic Foundations of Quantum Supremacy Experiments. Electron. Colloquium Comput. Complex. TR16 (2016) - [i2]Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan:
On SZK and PP. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c1]Lijie Chen, Pingzhong Tang:
Bounded Rationality of Restricted Turing Machines. AAMAS 2015: 1673-1674 - [i1]Lijie Chen, Jian Li:
On the Optimal Sample Complexity for Best Arm Identification. CoRR abs/1511.03774 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-10 18:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
