Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986)
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: Non-Black-Box Worst-Case to Average-Case Reductions Within NP |
scientific article; zbMATH DE number 7782637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) |
scientific article; zbMATH DE number 7782637 |
Statements
Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (English)
0 references
2 January 2024
0 references
average-case complexity
0 references
non-black-box reduction
0 references
time-bounded Kolmogorov complexity
0 references
minimum circuit size problem
0 references
0 references
0 references
0 references
0 references
0.8668417930603027
0 references
0.8490495681762695
0 references
0.8458167314529419
0 references
0.8424760699272156
0 references
0.816596508026123
0 references
