NP-hardness of approximating meta-complexity: a cryptographic approach (Q6939715)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8083315
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-hardness of approximating meta-complexity: a cryptographic approach |
scientific article; zbMATH DE number 8083315 |
Statements
NP-hardness of approximating meta-complexity: a cryptographic approach (English)
0 references
21 August 2025
0 references
meta-complexity
0 references
Kolmogorov complexity
0 references
minimum circuit size problem
0 references
witness encryption
0 references
CS proofs
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
