Lijie Chen

From MaRDI portal
Person:2481025

Available identifiers

zbMath Open chen.lijieMaRDI QIDQ2481025

List of research outcomes





PublicationDate of PublicationType
New PRGs for unbounded-width/adaptive-order read-once branching programs2024-11-14Paper
New lower bounds and derandomization for ACC, and a derandomization-centric view on the algorithmic method2024-09-25Paper
Black-Box constructive proofs are unavoidable2024-09-25Paper
Truly low-space element distinctness and subset sum via pseudorandom hash functions2024-07-19Paper
Extremely efficient constructions of hash functions, with applications to hardness magnification and PRFs2024-07-05Paper
Constructive separations and their consequences2024-07-03Paper
Towards multi-pass streaming lower bounds for optimal approximation of \textsf{Max-Cut}2024-05-14Paper
When Arthur has neither random coins nor time to spare: superfast derandomization of proof systems2024-05-08Paper
https://portal.mardi4nfdi.de/entity/Q61262242024-04-09Paper
https://portal.mardi4nfdi.de/entity/Q61262762024-04-09Paper
Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost2023-11-14Paper
Inverse-exponential correlation bounds and extremely rigid matrices from a new derandomized XOR lemma2023-11-14Paper
Almost optimal super-constant-pass streaming lower bounds for reachability2023-11-14Paper
Improved Merlin-Arthur protocols for central problems in fine-grained complexity2023-08-17Paper
Beyond Natural Proofs: Hardness Magnification and Locality2023-04-27Paper
https://portal.mardi4nfdi.de/entity/Q58757772023-02-03Paper
Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity2022-07-27Paper
Relations and equivalences between circuit lower bounds and karp-lipton theorems2022-07-27Paper
https://portal.mardi4nfdi.de/entity/Q50903962022-07-18Paper
Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization2022-05-31Paper
Efficient Construction of Rigid Matrices Using an NP Oracle2022-03-11Paper
Broadcast Congested Clique2021-01-20Paper
Strong average-case lower bounds from non-trivial derandomization2021-01-19Paper
Sharp threshold results for computational complexity2021-01-19Paper
https://portal.mardi4nfdi.de/entity/Q51408382020-12-17Paper
https://portal.mardi4nfdi.de/entity/Q51219022020-09-22Paper
On the Power of Statistical Zero Knowledge2020-08-25Paper
https://portal.mardi4nfdi.de/entity/Q51164972020-08-25Paper
https://portal.mardi4nfdi.de/entity/Q51164802020-08-25Paper
https://portal.mardi4nfdi.de/entity/Q51111522020-05-26Paper
Bootstrapping results for threshold circuits “just beyond” known lower bounds2020-01-30Paper
Beyond Natural Proofs: Hardness Magnification and Locality2019-11-19Paper
An Equivalence Class for Orthogonal Vectors2019-10-15Paper
Fine-grained Complexity Meets IP = PSPACE2019-10-15Paper
Adaptivity vs. Postselection, and Hardness Amplification for Polynomial Approximation2018-04-19Paper
https://portal.mardi4nfdi.de/entity/Q35714662010-07-08Paper
Limit analysis of structures containing flaws based on a modified elastic compensation method2008-04-07Paper

Research outcomes over time

This page was built for person: Lijie Chen

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:2481025&oldid=6820641"
Powered by MediaWiki