Capturing one-way functions via NP-hardness of meta-complexity (Q6499280)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Capturing one-way functions via NP-hardness of meta-complexity |
scientific article; zbMATH DE number 7844650
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Capturing one-way functions via NP-hardness of meta-complexity |
scientific article; zbMATH DE number 7844650 |
Statements
Capturing one-way functions via NP-hardness of meta-complexity (English)
0 references
8 May 2024
0 references
distributional Kolmogorv complexity
0 references
meta-complexity
0 references
one-way functions
0 references
0 references
0 references
0 references
