Tianqi Yang
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Black-Box constructive proofs are unavoidable | 2024-09-25 | Paper |
| Extremely efficient constructions of hash functions, with applications to hardness magnification and PRFs | 2024-07-05 | Paper |
| The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| 3.1 <i>n</i> − <i>o</i> ( <i>n</i> ) circuit lower bounds for explicit functions Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| Advances in Neural Networks – ISNN 2005 Lecture Notes in Computer Science | 2005-11-23 | Paper |
Research outcomes over time
This page was built for person: Tianqi Yang
