Cryptocomplexity and NP-completeness (Q3888962): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:34, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cryptocomplexity and NP-completeness |
scientific article |
Statements
Cryptocomplexity and NP-completeness (English)
0 references
1980
0 references
cryptocomplexity
0 references
NP-completeness
0 references
cryptosystems
0 references
knapsack problem
0 references
NP-hardness
0 references
cracking problem
0 references
