Tianqi Yang

Publication Activity (10 Years)

Years Active: 2021-2023
Publications (10 Years): 9

Top Topics

Average Case Complexity

Top Venues

Electron. Colloquium Comput. Complex.

IACR Cryptol. ePrint Arch.

Publications

Lijie Chen, Ryan Williams, Tianqi Yang
Black-Box Constructive Proofs Are Unavoidable. ITCS (2023)
Zhiyuan Fan, Jiatu Li, Tianqi Yang
The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity. STOC (2022)
Lijie Chen, Jiatu Li, Tianqi Yang
Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. Electron. Colloquium Comput. Complex. (2022)
Lijie Chen, Jiatu Li, Tianqi Yang
Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. CCC (2022)
Jiatu Li, Tianqi Yang
) circuit lower bounds for explicit functions. STOC (2022)
Zhiyuan Fan, Jiatu Li, Tianqi Yang
The Exact Complexity of Pseudorandom Functions and Tight Barriers to Lower Bound Proofs. Electron. Colloquium Comput. Complex. 28 (2021)
Jiatu Li, Tianqi Yang
3.1n - o(n) Circuit Lower Bounds for Explicit Functions. Electron. Colloquium Comput. Complex. 28 (2021)
Tianqi Yang
Tree Path Minimum Query Oracle via Boruvka Trees. CoRR (2021)
Zhiyuan Fan, Jiatu Li, Tianqi Yang
The Exact Complexity of Pseudorandom Functions and Tight Barriers to Lower Bound Proofs. IACR Cryptol. ePrint Arch. 2021 (2021)