The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity (Q6083551)
From MaRDI portal
scientific article; zbMATH DE number 7774392
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity |
scientific article; zbMATH DE number 7774392 |
Statements
The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity (English)
0 references
8 December 2023
0 references
Boolean circuits
0 references
circuit complexity
0 references
natural proofs
0 references
pseudorandom functions
0 references
random restrictions
0 references
threshold circuits
0 references
