Person:6083550
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 |
|---|---|---|
| Extremely efficient constructions of hash functions, with applications to hardness magnification and PRFs | 2024-07-05 | Paper |
| Unprovability of strong complexity lower bounds in bounded arithmetic | 2024-05-08 | Paper |
| Range avoidance, remote point, and hard partial truth table via satisfying-pairs algorithms | 2024-05-08 | Paper |
| Indistinguishability obfuscation, range avoidance, and bounded arithmetic | 2024-05-08 | Paper |
| 3.1 n − o ( n ) circuit lower bounds for explicit functions Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | 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 |
Research outcomes over time
This page was built for person:
