Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q6187822)
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 7788627
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cryptographic hardness under projections for time-bounded Kolmogorov complexity |
scientific article; zbMATH DE number 7788627 |
Statements
15 January 2024
0 references
Kolmogorov complexity
0 references
interactive proofs
0 references
minimum circuit size problem
0 references
worst-case to average-case reductions
0 references
0.9934179186820984
0 references
0.8412086367607117
0 references
0.8121874332427979
0 references
0.8097824454307556
0 references
