Lijie Chen
where else to find them
no profile links on file
what they talk about
all 6 in the filters
where they keep going back
- ITCS3 editions2021–2023
all 5 in the filters
on a stage with
- Ryan Williams2×
- Badih Ghazionce
- Ce Jinonce
all 10 in the filters
who talks about the same things
- Shuichi Hirahara7 talks
- Pasin Manurangsi8 talks
- Toniann Pitassi5 talks
- Ryan Williams18 talks
- Dor Minzer8 talks
- Yuval Filmus9 talks
| title | conference | date |
|---|---|---|
| Pseudorandomness and Pseudoentanglement in Holography | Quantum Complexity: Quantum PCP, Area Laws, and Quantum Gravity 2024 | 2024-03-18 |
Constructs explicit tensor-network CFT ensembles that are computationally indistinguishable yet have different RT entropies: exact RT for tree tensor networks… | ||
| Derandomization: A Quick Tutorial | Minimal Complexity Assumptions for Cryptography 2023 | 2023-05-01 |
Shows a conditional conversion that turns any constant‑round, doubly‑efficient interactive proof into an NP-type deterministic argument with essentially the… | ||
| New Lower Bounds and Derandomization for ACC, and a... | Lower Bounds, Learning, and Average-Case Complexity | 2023-02-13 |
Proves concrete derandomization and lower-bound steps: shows MA_sub_ACC0 ⊆ i.o.NQP with quasi‑polynomial verification but polynomial‑length proofs, uses PCPs… | ||
| Black-box Constructive Proofs are Unavoidable | ITCS 2023 | 2023-01-10 |
Main claim: proving NEXP not in a typical circuit class C is equivalent to the existence of a black-box constructivity — a randomized poly(n)-time oracle… | ||
| New Lower Bounds and Derandomization for ACC, and a... | ITCS 2023 | 2023-01-10 |
Proves concrete circuit lower bounds and derandomizations: shows MA_sub_ACC0 has no n^k-size ACC0 circuits by building an AC0-parity verifier from a… | ||
| Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity | ITCS 2022 | 2022-01-31 |
Presents concrete Merlin–Arthur protocols and time bounds: near-linear MA for 3SUM by reducing to counting solutions mod d, encoding inputs as a polynomial… | ||
| Average-case Hardness of NP and PH from Worst-case Fine-grained Assumptions | ITCS 2022 | 2022-01-31 |
Proves concrete average-case hardness from weaker worst-case fine‑grained assumptions: improving on Hirahara’s 2^{O(N/log N)} threshold, the paper shows that… | ||
| On Distributed Differential Privacy and Counting Distinct Elements | ITCS 2021 | 2021-01-06 |
Shows that distinct counting under constant-epsilon, delta = 1/poly(n) privacy is basically impossible in the local model: any local protocol needs error ≈ N /… | ||
| Recent Structure Lemmas for Depth-two Threshold Circuits | Boolean Devices 2018 | 2018-09-10 |
Shows two explicit structure lemmas: any poly-size depth-2 threshold circuit is constructively written as a disjoint OR decomposition into majority-of-majority… | ||
| nothing matches | ||