NP-hardness of approximating meta-complexity: a cryptographic approach (Q6499285)
From MaRDI portal
scientific article; zbMATH DE number 7844654
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-hardness of approximating meta-complexity: a cryptographic approach |
scientific article; zbMATH DE number 7844654 |
Statements
NP-hardness of approximating meta-complexity: a cryptographic approach (English)
0 references
8 May 2024
0 references
minimum circuit size problem
0 references
NP-hardness
0 references
cryptography
0 references
meta-complexity
0 references
witness encryption
0 references
0 references
0 references
0 references
0 references
0 references
0 references
