Tianqi Yang

According to our database, Tianqi Yang authored at least 7 papers between 2021 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Black-Box Constructive Proofs Are Unavoidable.

Lijie Chen, Ryan Williams, Tianqi Yang

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs.

Lijie Chen, Jiatu Li, Tianqi Yang

Electron. Colloquium Comput. Complex., 2022

3.1<i>n</i> - <i>o</i>(<i>n</i>) circuit lower bounds for explicit functions.

Jiatu Li, Tianqi Yang

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity.

Zhiyuan Fan, Jiatu Li, Tianqi Yang

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021

3.1n - o(n) Circuit Lower Bounds for Explicit Functions.

Jiatu Li, Tianqi Yang

Electron. Colloquium Comput. Complex., 2021

The Exact Complexity of Pseudorandom Functions and Tight Barriers to Lower Bound Proofs.

Zhiyuan Fan, Jiatu Li, Tianqi Yang

Electron. Colloquium Comput. Complex., 2021

Tree Path Minimum Query Oracle via Boruvka Trees.

Tianqi Yang

CoRR, 2021